For the next 3 questions, consider the following pseudocode…

For the next 3 questions, consider the following pseudocode (lines are numbered for easy subsequent reference). 0 procedure sort(A : list of sortable items) 1 n := length(A) 2 do 3 swapped = false 4 for i := 1 to n – 1 inclusive do 5 if A[i – 1] > A[i] then 6 swap(A[i – 1], A[i]) 7 swapped := true 8 while swapped 9 end procedure

Comparing your Big-O for this new approach and the Big-O for…

Comparing your Big-O for this new approach and the Big-O for the approach that splits each problem into only 2 subproblems, what can you conclude about how the number of subproblems into which you split the convex hull problem affects the runtime? Justify your answer.

Show the simplified result of this expression expression rep…

Show the simplified result of this expression expression representing the appropriate additions and multiplications of the Big-O complexities you annotated in the last step (i.e., combine like terms). Keep constants and lower order terms for this step (we’ll ask for final Big-O in the next question). Show your work.