Scenario: Let L be a list of integers, we wish to find the mode. The mode is the value that appears most often in the list. Let n be the length of the list, and let k be the number of different values in the list. For example, if the list L=2,3,6,4,6,4,6,6,3 then n= 10, k= 4, and the mode is 6. Assume that the values in the list L are all between 1 and M, and that you have enough memory to construct an array of size M. Questions 8 and 9 are related to this scenario. In words, describe an algorithm to implement the mode described above with a time complexity, O(n)