Describe an algorithm does the following:

It takes as input a list of n integers, where n is an even number.

If two adjacent integers in the list are such that the first is less than the second, then the algorithm swaps their values.

That is$,$ if ak $<$ ak$+1$ then it swaps the value in ak with the value in ak$+1$

Here is the operation's header:

procedure swap Adjacent$($a$1,$ a$2,$ a$3,...,$ an : integers$)$

It has to be a pseudocode that must be formatted.