Given a list of randomly arranged numbers, for example (6,2,9,5,8,7). Find the total number of upturns in such list. If (a list[b]), then the pair (a, b) is called an upturn of

the list. In the given example, (6,2), (6,5), (9,5), (9,8), (9,7), (8,7) are of possible upturns that

meet the conditions and hence there are 6 upturns in such list.

a) Design a brute-force algorithm to return the number of possible upturns, and analyse

the complexity of your solution (5 marks)

b) Design a more efficient algorithm to do the same task with less complexity, and analyse

the complexity of your solution. (15 marks)

[Important instruction to be followed: Create an arbitrary unsorted list of 6 numbers

and use it to provide full explanation of how your proposed algorithm should work

step by step]