notes ( bubble sort heap sort proceeds in (afive phase (bthree phases (cone phase (dtwo phase fill in the blanks arranging objects in specified order is called the average time complexity of the quick sort algorithm is the computing time of heapsort is the time complexity of the algorithm is both average and worst case state whether the following statements are true or false the order of linear search in worst case is ( / linear search is more efficient than binary search for binary searchthe array has to be sorted in ascending order only file is collection of records and record is in turn collection of fields review questions what is sortingexplain insertion sorting in details distinguish between quick and heap sort explain -way merge sort distinguish between linear and binary search explain the application of searching consider the list given below whose elements are arranged in an ascending order assume that binary search technique is used find out the number of probes required to find each entry in the list sort the list given below by applying the heapsort method lovely professional university