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]

This question involves a class named textfile that represents a text file. public class textfile { private string filename; private string filename; private arraylist words; // constructors not shown // postcondition: returns the number of bytes in this file public int filesize() { } // precondition: 0 < = index < words. size() // postcondition: removes numwords words from the words arraylist beginning at // index. public void deletewords(int index, int numwords) { } // precondition: 0 < = index < = words. size() // postcondition: adds elements from newwords array to words arraylist beginning // at index. pub lic voidaddwords(int index, string[] newwords) { } // other methods not shown } complete the filesize() method. the filesize() is computed in bytes. in a text file, each character in each word counts as one byte. in addition, there is a space in between each word in the words arraylist, and each of those spaces also counts as one byte. for example, suppose the words arraylist stores the following words: { mary had a little lamb; its fleece was white as snow. } the filesize() method would compute 4 + 3 + 1 + 6 + 5 + 4 + 6 + 3 + 5 + 2 + 5 as the sum of the lengths of each string in the arraylist. the value returned would be this sum plus 10, because there would also be 10 spaces in between the 11 words. complete the filesize() method below: // postcondition: returns the number of bytes in this file public int filesize() { }