Answer True or False to the following problems. Quick son should NOT he used when the data is almost sorted. ___ Quick sort is always quick. ___ Merge soft requires extra space. ___ Selection sort recognizes if the values are already sorted. ___ Binary searching is always faster than linear searching. ___ HeapSort is inherently unstable. ___ Show the contents of the array After each of the first two iterations of (1) Selection Sort Bubble Son Insertion Son Show how the values in the array in Problem 2 would have to be rearranged to the heap property