Start with this program: $$ InsertAtBottomProblem.zipDownload InsertAtBottomProblem.zip

and write the code for the missing InsertAtBottom method.

When you have it correct, the output from the program should be:

$$

$3$Susan $$Software Engineering

$2$Lee $$Music

$1$Joe $$Physics

Just removed Joe

$3$Susan $$Software Engineering

$2$Lee $$Music

now adding $2$ new students

$3$Susan $$Software Engineering

$2$Lee $$Music

$10$Bill $$English

$11$Jean $$History

$$

I strongly urge you not to cheat and$/$or use AI$.$ You can't take AI with you to an interview.

Hint:

Create a new LinkedListNode with the passed in object.

Then check if list is empty, if it is$,$ make frontOfList point to it$.$ Done.

If there are one or more nodes, create a current variable and move it down the LL until its next node pointer is null,

that means you are at the bottom of the list.

Add your new node.