Using the algorithm discussed in class, decompose G into str…

Using the algorithm discussed in class, decompose G into strongly connected components (SCCs). Show your work. Break ties alphabetically. List here each SCC in the order that it is discovered. Write each SCC as a set with nodes ordered according to the order in which they are added to the SCC by the SCC algorithm.

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.