1. Each baby has brown hair or purple hair. Design a one-pass and in- place and linear time algorithm to sort the babies according to their hair color: brown hair babies followed by purple hair babies. In your algorithm, you must use only two pointers. (a). Please tell me explicitly what the constraints are we put on those two pointers (i.e., you interpret intuitively, and possibly with some drawings on the meanings of "one-pass", "in-place", and "linear-time".). (b). The thought process of designing an algorithm is really important - you have to walk in the right direction at the first trial. When you design the algorithm, you have to bear in mind simontaneously the three constraints ("one-pass", "in-place", and "linear-time") while moving the two pointers in your mind on the array of babies. Please write down the thought process of your design of the algorithm and in particular, mentioning among the three constraints, which one you consider the first and why. (c). Please write on almost working psuedo-code with comment