Q4. Suppose an array consists of n elements, each of which is red, white, or blue. Sketch an efficient algorithm to sort the elements so that all the red come before all the white, which come before all the blues. The only operations permitted on the keys are: Examine(A, i) report the color of the ith element of A. Swap(A,LJ)-swap the ith element of A with the ith element