basic python with no lambda

Lab Description: Write a function that would do the following: - Alphabetize a list based on the second letter of each word. You can assume all characters are lower case. - If there are any words that have the same second letter as each other - remove any word afte the first word of those matches. - Add to the end of the list another copy of all the words in which the second letter is a vowel. - Add the length of all the words in the updated list and return the sum. Sample Data the_list = ['redundant', 'profuse', 'humdrum', 'common', 'obey', 'receive', 'young', 'business', 'join', 'bad', 'observe', 'smooth', 'mighty',' 'page', 'simplistic', 'rifle', 'true', 'class', 'thundering', 'nostalgic', 'play', 'seemly', 'fumbling', 'rabbits', 'abstracted', 'soap', 'teeny', 'probable',' 'enthusiastic', 'ubiquitous'] Sample Output "output depends on original sort" 111 ['bad', 'obey', 'redundant', 'thundering', 'mighty', 'class', 'smooth', 'enthusiastic', 'nostalgic', 'true', 'business', 'bad', 'redundant', 'mighty', 'nostalgic', 'business'] OR 106 ['bad', 'obey', 'redundant', 'thundering', 'mighty', 'class', 'smooth', 'enthusiastic', 'common', 'profuse', 'humdrum', 'bad', 'redundant', 'mighty', 'common', 'humdrum'] OR 107 ['rabbits', 'obey', 'receive', 'thundering', 'rifle', 'class', 'smooth', 'enthusiastic', 'soap', 'probable', 'fumbling', 'rabbits', 'receive', 'rifle', 'soap', 'fumbling']