1. It is possible to sort an array of n values using a pipeline of n filter processes. The first process inputs all the values one at a time, keeps the minimum, and passes the others on to the next process. each filter does the same thing: it receives a stream of values from the previous process, keeps the smalleest and passes the others to the next process. Assume each process has local storage for only two values- the next input value and the minimum it has been so far.

- Develop code for the filter processes. Declare the channels and use asynchronous message passing.