You are given a list of randomly arranged numbers, for example (11,7,18,5,17,13). The

triple (11, 7, 5) is called the "inversion triple" because (5<7<11) in terms of value, while

the index of 5 in the list is greater than the index of 7, and the index of 7 is greater than

11. Therefore, we can find 2 inversions in such list as follows: (11,7,5), and (18,17,13).

Your main task is to find the total number of inversions in any given list.

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

analyse the complexity of your solution

b) Develop a python code to implement your brute-force algorithm.

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

analyse the complexity of your solution.

[Important instruction to be followed: Create an arbitrary unsorted list of 8 characters

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

step by step]

d) Prepare a brief report (250 words) comparing the two algorithms