A) Suppose you have algorithms with five running times listed below. How much slower do each of these algorithms get when you double the input size? (i)n2 (ii)n3 (iii)100n2 (iv)n log n (v)2n b) Suppose algorithm A takes 10 seconds to handle a data set of 1000 records. Suppose the algorithm A is of complexity O(n2). Answer the following: (i) Approximately how long will it take to handle a data set of 1500 records? Why? (ii) How long will it take to handle a data set of 5000 records? Can you come up with a reason why this will not be entirely accurate but will just be an approximation?.