public class Question5 {

/**

* Sort input array with two distinct keys

*

* Worst case running time should be linear

* Worst case space complexity should be constant

*/

public static > void sort(T[] a) {

// provide implementation here

}

}

5. (10 Points) Observe how quick sort works on an input array having just two distinct keys. Based on that observation, implement the following sort method inside Question5 class that sorts any array with two distinct keys in linear time and constant space in the worst case. Sort input array with two distinct keys *Worst case running time should be linear *Worst case space complexity should be constant public static void sort(TC] a) f /7 provide implementation here