1. Compare the performance by computing the time in hrs, min, sec) taken by two machines A and B. A executes 10% instr./sec and executes 10 instr./sec. A runs bubble sort with c1=5 and Bruns insertion sort with c2=5. Both are given an array of sorted input of size 1 billion numbers. (5 marks) (2 marks) 2. Is the following sorting algorithm stable. Give exact reason for your answer. for i=1 upto n-1 for jen downtoi+1 if(Ali]