In a language of your own choosing, write a computer program that emulates a batcher-banyan network with 8 inputs and 8 outputs. for this project, you don’t need to implement a bitonic sorter; you may use any sorting algorithm you wish. in addition to program source code, provide a screenshot showing the deliverable are identified below. demonstrate that your program works in the following input cases by showing, the before and after of packet sorting, and where each packet travels at each stage of your multistage network. a. one packetb. two packets (different destinations)c. four packets (different destinations)d. six packets (different destinations)e. seven packets (different destinations)f. skip the sorting stage to show an example of output port contention with two packets destined for the same output portg. skip the sorting stage to show an example of path contention with two packets destined for the same shared link