1 1 Analysis and design of algorithms course Assignment \#2 St.name: St.NO: Write whether each of the following statement is true (T) or false (F) 1- If the array is sorted Insertion sort is faster than merge sort. 2- Algorithm is thus a sequence of computational steps that transform the input into the output. 3- Algorithm is a tool for solving a well - specified computational problem. 4- Any special method of solving a certain kind of problem is called algorithm. 5- Algorithm study amount of work done(aka complexity) 6- In Asymptotic analysis we only care about the running time of our algorithm as the size of the input goes to zero. 7- The complexity of the average case of an algorithm is Much more complicated to analyses than that of worst case 8- The asymptotic notation that represent the Best Case analysis of insertion sort is: O(n2)