2. Big-O analysis (Worst Case Time Complexity) a. Find the worst case runtime (big-O notation) for the following pseudo code which returns true if an integer n is prime, false if it is not prime. procedure isPrime(n) if n 1 return false else if n 3 return true else for i in 2 to sqrt(n) If n i return false return true b. Find the worst case runtime (big-O notation) for the SelectionSort algorithm. This algorithm sorts an array A of length n. proceedure SelectionSort(array a, length(A) n) for i in 0 to n 2 max Index i for j in (i 1) to (n 1) if a[i] A[maxIndexl maxindex swap Ali, Almaxindex])