(50 points) Implement bubble sort for a list of integers using the following pseudocode as a design. in HASKELL

swapPass(xs)

if there is only one element return that element

otherwise

let x be the first value, let y be the second value,

let xs be the remaining list

if x > y y : swapPass(x:xs) else x : swapPass(y:xs)

loopOverAll(xs, numberOfElements)

if numberOfElements == length of xs

return xs

otherwise

loopOverAll(swapPass(xs), numberOfElements+1)

THE NUMBERS TO SORT ARE AS FOLLOWS: 6, 9, 1993, 23, 1, 75

(50 points) Implement bubble sort for a list of integers using the following pseudocode as a design swapPass (xs) if there is only one element return that element let x be the first value, let y be the second value, ifx>y else otherwise let xs be the remaining list y swapPass (x:xs) x swapPass (y:xs) loopOverAll (xs, numberOfElements) if numberOfElementslength of xs return xs otherwise loopOverAll (swapPass (xs),numberOfElements+1)