Q3-8 pts) Consider the following pseudo code to determine whether an integer 'n' is prine d and wha Identily the basic operation, the best case and worst case number of times it will be cxec would be the asymptotic time complexity of the algorithm (Use the most appropriate Input n for (i = 2 to n-1) at if (n mod i0) return "n is not prime" end if end for return "n is prime" discussed in the class all the other Q4-14 pts) Consider the implementation of the List class using dynamic arrays as slides/ lecture code. Consider the following version of the insertAtlndex function. Assume a variables and functions to be the same as those in the slides/lecture code. void insertAtIndex(int insertlndex, int data) if (insertIndex > endOfArray+) if (endOfArraymaxSize-1) for (int index = insertIndex, index