An inversion in a sequence is a pair of entries that are out of order. For example, the characters F and D form an inversion in the string 'ABBFHDL'. The characters H and D are also an inversion in the string 'ABBFHDL'. The total number of inversions in a sequence, i. e. the number of pairs that are out of order, is a measure of how unsorted the sequence is. Write a function inversions() that takes as a parameter a sequence of uppercase characters (i. e. a string with only uppercase letters) and returns the number of inversions in the sequence. The following shows the function on several sample parameters: def inversions(s):
count = 0
for i in range(len(s)): # for each index i
for j in range(len(s)): # for each index J
if s[j]>=s[i]: # compare string[i] and string[j]
count += 0
else:
count +=1
return count