The solution to the following recurrence 7(n)= 27T (n/3) +n^3 using the master theorem is Question 5 Not yet answered Marked out of 1.00 Flag question Select one: O a. O(n^3) O b. O(n.log n) O c. Master theorem can't be applied O d. O(n^3.log n) Which of the following properties is not true about a simple graph? Question 6 Not yet answered Marked out of 1.00 P Flag question Select one: O a. Must be connected O b. Must have no loops or multiple edges O c. Must be unweighted O d. All of the mentioned In binary heaps, the parent of a node in index i (assuming this node has a depth of at least 2) is located at index: Question 7 Not yet answered Marked out of 1.00 P Flag question Select one: O a. 21 O b.floor(1/2) O c.floor(i/4) O d. None of the above Time left 1:24:21 Apply Quick sort on a given sequence 7 11 14 6 9 4 3 12. What is the sequence after first phase, pivot is first element? Question 8 Not yet answered Marked out of 1.00 Flag question Select one: O a. 6 4 3 7 11 9 14 12 O b. 6 3 4 7 9 14 11 12 O c.76 4 3 9 14 11 12 O d. 76 14 11 9 43 12 Does the following array represent a max heap? A=[53,14,51,12,13,2.49,13,9,12,100.1,48] Question 9 Not yet answered Marked out of 1.00 P Flag question Select one: O a. False O b. True