3. Consider the following problem: You have a large collection of music files (e.g., MP3 files), and for each file you know the artist name (as a string) and the song title (also as a string). You wish to find the name of the artist who has the largest number of songs featured in the collection. 1. Describe an algorithm for this problem. For full marks, the algorithm should be as efficient as possible. [15 marks] 2. State the running time of your algorithm, assuming that there are in total n songs, across t different artists. [10 marks]