suppose we are given a sequence s of n elements, each of which is colored red or blue. assuming s is represented as an array, give an in-place method for ordering s so that all the blue elements are listed before all the red elements. can you extend your approach to three colors? in-place means that only swap operations are allowed