Write a program that performs the following tasks: 1. Asks the user for the number of DNA sequences to enter, retrieves that many sequences from the keyboard and saves them in a list. 2. Using the list of sequences from problem 1, the program finds and prints to the screen the shortest sequence in the list. 3. Using the list of sequences from problem 1, the program calculates and prints to the screen the number of valid sequences, i.e. sequences that contains just the letters A, C, G, T. For example, if the list contains ['ACAGTAT', 'CGTD', 'AGGTGAAA'l, the program will print 2