The following problem is known as the dutch flag problem. in this problem, the task is to rearrange an array of characters r, w, and b (for red, white, and blue, which are the colors of the dutch national flag) so that all the r’s come first, all the w’s come next, and all the b’s come last. design a linear, in-place algorithm that solves this problem.