Consider the following algorithm, which may be called on an array that is not necessarily sorted. and returns the array in sorted form. GoofySort (A) : if (len (A) <= 3): SelectionSort (A) else: Let t + slen(A)/3] A[1:2t] + GoofySort (A[1:2t]) A[t+1:n] + GoofySort (A[t+1:n]) //sort the back 2/3rds //sort the front 2/3rds A[1:2t] GoofySort (A[1:2t]) //sort the front 2/3rds (a) Write a recurrence which captures the runtime of this algorithm. Your recurrence should be of the form T (n) =?. You can ignore any non-recursive operations (i.e. you only need to focus on operations in the last three lines). You do not need to handle base cases here. You can assumen is divisible by 3 for convenience. (b) Solve your recurrence using the substitution method. Show your work. You may assume a base case of T (1) = 1. State what the big-O runtime is for this algorithm (hint: it should be a polynomial written in the form n). %3D

The contents of the array below represent a BST (Binary Search Tree). What would be the contents of the array after 30 is deleted. Briefly explain how 30 would be deleted. Use an X to represent any empty spots in the array. 30 2050 10 25 40 60

Java: Consider the following algorithm for searching in an unsorted array. If the size of the array is 1, then check if it contains the element to be searched. Otherwise, divide the array into two halves, and recursively search both halves. Which of (a)–(c) is false? The running time of this algorithm is O(N) The actual running time of this algorithm is likely to be better than sequential search. This is an example of a divide‐and‐conquer algorithm all of the above are true none of the above is true

Let A = [n, n − 1, n − 2, . . . , 3, 2, 1] be an array where the first n positive integers are listed in decreasing order. Determine whether Heapsort or Quicksort sorts this array faster.For this question, assume the Quicksort pivot is always the right-most element.

PYTHON: Please provide a screenshot of your code in Python. Thank you!

15. Consider the problem of finding the first position in which an array b occurs as a subsequence of an array a. Write two nested loops: let result undefined for (let i = 0; i < a.length - b.length; i++) { for (let j = 0; j < b.length; j++) { if (a[i+j] = b[j]) . . . } } Complete with labeled break and continue statements.

Background for Question 14-20: Below is a bubble sort program that sorts the elements in an array. static void bubbleSort(int[] arr) { int n = arr.length; int temp = 0; for (int i = 0; i < n; i++) { for (int j = 1; j < (n - i); j++) { if (arr[j - 1] > arr[j]) { temp = arr[j - 1]; arr[j - 1] = arr[j]; arr[j] = temp; } } } } Based on the program above, please draw a control flow graph for it. In your control flow graph, what are the test requirements for edge coverage? List test path(s) that achieves the edge coverage. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason. In your control flow graph, what are the test requirements for...