604, 842, 324, 270, 898, 328, 775, 624, 791, 500, 421, 674, 768, 28, 280, 891, 10, 765,925, 26, 798, 431, 819, 865, 903, 11,9, 688 (a) Carry out the "SELECT" algorithm on the array below to return the 19th smallest element in the array. Assume that if the number of elements in the array is less than 6 elements, then you can sort and return the sought element. Show all your intermediate steps b) What is the time and space complexity of the "SELECT" algorithm