Short Questions: a) Given a set of 200 unsorted data (ie, N = 200). What would be the runtime if Bubble sort is used to sort them? b) What is the basic difference between an Iterative function and a Recursive function? c) Given runtimes of two algorithms as below: T1(N) = NIgN and T2(N) = N2VN Which algorithm will have shorter runtime, 1 or 2, give justifications, d) Give examples of at least three algorithms based on Divide and Conquer principles. e) Given the following data set: 12, 23, 29, 31, 41, 56, 71, 81, 91, 191 Which algorithm out of Insertion sort, quick sort and Merge sort will having shortest runtime and what will be that runtime