1 Short Questions: Grenoset of 200 uniorted data fle. N-200). Whet would be the runtime if Bubble sort a used to sort ? ) What is the basic diference between an iterative function and a Recursive function? Given runtimes of two algorithms as below. T.IN) Mand T./N) - NVN which algorithm will have shorter runtime. 1or 2. give justifications. d) Give examples of at least three algorithms based on Divide and Conquer principles e) Given the following doto set: 12. 23. 29, 31, 41, 56, 71, 81, 92, 191 Which algorithm out of insertion sort, quick sort and Merge sort will having shortest Funtime and what will be that runtime? 2.Given a function as below int Rate fint INO) return; che retum 5.5 al What type of function is this? Recursive/iterative Give juscono Recursive as the function of W Compute the value of F118 Shows 3. Alustrate Partition algorithm of Quick sort on the following data, give the detailed explanations 41. 120, 36, 16. 51. 32, 18, 40 Also give the total runtime. 4. Hlustrate insertion Sort on the following data set and compute the runtime as well. 37. 18, 49, 40, 67, 42, 25 5. Given the following pseudocode. Convert into a C++ program. Sort/A, N) for 2 to N key Am i 1-1 while i > and All > key A[i+1] tam in-1 exchange A{1+1) 76 key