1. Provide pseudo-code for an in-place (no extra storage) algorithm to take an array of n integers and rearrange it such that all of the odd numbers occur before any of the even numbers.

.2.. What is the worse case runtime complexity of your solution to problem 1

3. What is the average case runtime complexity of your solution to problem 1?

4. Is your solution to problem 1 stable, in the sense that values with the same parity will not be exchanged?

5. Does your solution in problem 1 remind you of any sorting algorithm that we have studied? If so, explain any difference in the average runtime complexity between the sorting algorithm and problem 1.