PLEASE provide detailed explanation with pseudo-code for each part. Thanks!

Suppose that we have an array of n data records to sort and that the key of each record has the value 0 or 1. An algorithm for sorting such a set of records might possess some subset of the following three desirable properties:

1. The algorithm runs in O (n) time

2. The algorithm is stable

3. The algorithm sorts in place, using no more than a constant amount of storage space in addition to the original array

(a) Describe an algorithm that possesses properties (1) and (2)

(b) Describe an algorithm that possesses properties (2) and (3)

(c) Describe an algorithm that possesses properties (1) and (3)