2. Suggest a structured plan (algorithm) for the bubble sort and selection sort, and perform running time analysis for both best and worst case. 3. Consider the age data of 12 children who are supposed to undergo for vaccination in ascending order of their age. Suggest and apply a sorting technique which can efficiently handle this data. Show all the intermediate steps clearly. Child ID 01 02 03 04 05 06 07 08 09 10 11 12 2. Age 1 4 4. Given an array of 14 elements, Show that the worst-case running time of Heap sort on this array is O(nlogn). 4 25 99 8 16 28 13 10 7 17 A= 12 2 18 5. Determine the cyclomatic complexity of the code segment given below, Describe the method for the same. i = 0; n=6; while (i<-1>