It is possible to sort an array of n values using pipeline of n filter processes.The first process inputs all the values one at a time, keep 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, keep the smallest, 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 seen so far. (a) Developcode for filter processes. Declare the channels and use asynchronous message passing. Hint:Define an array of channels value[n] (int), and a set of filter processes Filter[i = 0 ton-1]. Each process Filter[i] (where 0 <= i <= n-2) receives a stream of integers through channelvalue[i], keeps the smallest, and sends all other integers to channel value[i+1]. The last processFilter[n-1] receives only one integer through channel value[n-1] and does not need to send anyinteger further.

It is possible to sort an array of n values using pipeline of n filter processes.
The first process inputs all the values one at a time, keep 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, keep the smallest, 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 seen so far.

(a) Developcode for filter processes. Declare the channels and use asynchronous message passing.

Hint:Define an array of channels value[n] (int), and a set of filter processes Filter[i = 0 to
n-1]. Each process Filter[i] (where 0 <= i <= n-2) receives a stream of integers through channel
value[i], keeps the smallest, and sends all other integers to channel value[i+1]. The last process
Filter[n-1] receives only one integer through channel value[n-1] and does not need to send any
integer further.