Data Structures and Algorithms ASAP Create a Cantor Set Recursively using Line in processing line(startX,startY,endX,endY) where the starting point of the line is at coordinates (startX,startY) and the ending point of the line is at coordinates (endX,endY) Remember the top left of the screen is (0,0) and the plus x direction is to the right and the plus Y direction is downward Requirements 1) Each line should follow the following pattern https://en.wikipedia.org/wiki/Cantor_set#/media/File:Cantor_set_binary_tree.svg 2) The number of lines created should be printed into the console by returning the number from recursion

Task- Median elements (C Language) Example #4 expected output is 5, but from the program below its coming out to 4. Please help make it come out to 5 as expected Given an array of integer elements, the median is the value that separates the higher half from the lower half of the values. In other words, the median is the central element of a sorted array. Since multiple elements of an input array can be equal to the median, in this task you are asked to compute the number of elements equal to the median in an input array of size N, with N being an odd number. Requirements Name your program project4_median.c. Follow the format of the examples below. The program will read the value of N, then read in the values that compose the array. These values are not necessarily sorted. The program should include the following function. Do not modify the function prototype. int compute_median(int *a, int n); a represents the input array, n is the length of the array. The function returns the…

Course: Introduction to matlab programming student number:  180505005

Python question Application: Big-O Notation (Q8-11)  For each of the time complexities in this segment give the tightest bound in terms of a simple polylogarithmic function using big-O notation. Note: use the ‘^’ symbol to indicate exponents, i.e., write O(n^2) for O(n2).   Question 8 (Big-O Notation 1) T(n) =  n2+ log n + n   Question 9 (Big-O Notation 2) T(n) = n/3 + 4 log n + 2n log(n)   Question 10 (Big-O Notation 3) T(n) = 7n5 + 2n   Question 11 (Big-O Notation 4) T(n) = (n%5) + 12,000