Question $8$

$15pts$

Programming

Write a static method named longestName that reads names typed by the user and prints the longes $t$ name $($the name that contains the most characters$)$ in the format shown below. Your method shou Id accept a console Scanner and an integer $n$ as parameters and should then prompt for $n$ names. The longest name should be printed with its first letter capitalized and all subsequent letters in lowercase, regardless of the capitalization the user used when typing in the name.

If there is a tie for longest between two or more names, use the tied name that was typed earlie st$.$ Also print a message saying that there was a tie, as in the right log below. It's possible that some shorter names will tie in length, such as DANE and Erik in the left log below; but do $n^{\text{'}}t$ print a message unless the tie is between the longest names.

You may assume that $n$ is at least $1,$ that each name is at least $1$ character long, and that the $u$ ser will type single$-$word names consisting of only letters. The following table shows two sampl e calls and their output.

$\backslash$table$[[$Call$,\backslash$table$[[$Scanner console $=$ new Scanne$],[$ System.in$)$;$],[$longestName console, $5$