Problem $4.$ points$)$ Top $k$ baby names

You have a massive repository of baby names, extracted from a census report, which is a list

of $n$ names of all babies $($including duplicates$)$ within a region. You are asked to compute the $k$

most popular baby names, in sorted order of popularity; here $k$ is a positive integer less than

number of distinct names in the list.

$($a$)$ State clearly the input and output for the given problem.

$($b$)$ Describe an algorithm, in pseudocode, to solve the problem. Your algorithm may use any

of the algorithms we have covered in class.

$($c$)$ Analyze the worst$-$case running time of your algorithm.

Solution: Type your solution here.