Problem 2 (14 pts) The Simplified Dutch National Flag Problem Given an array arr[0..N-1] where each of the elements can be classified as red or blue, write pseudocode to rearrange the elements of arr so that all occurrences of blue come after all occurrences of red and the variable k indicates the boundary between the regions. That is, all arr[O..k-1] elements will be red and elements arr[k..N-1] will be blue. Assume the existence of a function swap(arr, i, j) which swaps the ith and ith elements of arr. (8 pts) The following picture illustrates the condition of the array at exit. arr | red I a11 blue Write an expression for the postcondition. (2 pts) Write a suitable loop invariant for any loops in your pseudocode. (4 pts)