Write an algorithm of successively compares pairs of adjacent elements,exchanging them if they are out of order, and alternately passing through the listfrom the beginning to the end and then from the...

Write an algorithm of successively compares pairs of adjacent elements,exchanging them if they are out of order, and alternately passing through the listfrom the beginning to the end and then from the end to the beginning until noexchanges are needed.(B): Find number of comparisons and time complexity of the above algorithm.(c): Implement this algorithm in C++ code.Frequency of microprocessor= 2.4GHZ.