Download a copy of the file www.py4e.com/code3/romeo.txt. Write a program to open the file romeo.txt and read it line by line. For each line, split the line into a list of words using the split function. For each word, check to see if the word is already in a list. If the word is not in the list, add it to the list. When the program completes, sort and print the resulting words in alphabetical order. Enter file: romeo.txt ['Arise', 'But', 'It', 'Juliet', 'Who', 'already', 'and', 'breaks', 'east', 'envious', 'fair', 'grief', 'is', 'kill', 'light', 'moon', 'pale', 'sick', 'soft', 'sun', 'the', 'through', 'what', 'window', 'with', 'yonder'] Given two .txt files that have lists of numbers in them, find the numbers that are overlapping. One .txt file has a list of all prime numbers under 1000 , and the other .txt file has a list of happy numbers up to 1000. (Prime numbers are numbers that can't be divided by any other number. And happy numbers are a real thing in mathematics - you can look it up on Wikipedia.) The overlaping numbers in both files are: [7,13,19,23,31,79,97, 103,109,139,167,193,239,263,293,313,331,367,379,383,397, 409,487,563,617,653,673,683,709,739,761,863,881,907,937]