design a program

that perform the bubble sort, selection

sort, and insertion sort algorithms on an Integer array, such that each module keeps

a count of the number of swaps it makes.

Then, design an application that :

uses three identical arrays of at least 20 integers (use random function for

values)

-Displays unsorted arrays

-calls each sorting module on a different array

-displays the sort name , the sorted array and number of swaps made by the

algorithm

NEEDS TO BE DONE IN PSUEDO CODE