The module midterm contains a function complexity, which accepts a string as input, and returns an average measure of the scarcity of the letters used within the string. For example, complexity('treat') returns 1.388278229015375 , since the letters used in that word are all very common. complexity('pizza') howeve returns 13.650743077691248 , due to the double 'z'. Write a function weirdest_word which accepts a list of strings, and returns the string contained in the list that maximises the value of the function complexity. ( You may assume that each input list will contain a unique string that maximises complexity)