I need this to be solved in Java. The stack TOWNS holds several town names, and the name "Cardiff" is on the top of the

TOWNS stack $($see Figure $1$a$).$ An algorithm is needed that will reverse the contents of

the TOWNS stack. The name "Geneva" should be on top of the TOWNS stack after

reversing its contents $($see Figure $1b).$

Figure $1$: Example data held on the Towns stack before

and after execution of the requested algorithm

a$.$ The content in the rowns stack

before it is reversed

b$.$ The content in the TOWNS stack

after it is reversed

$($d$)$ Construct an algorithm that will reverse the TOWNS stack using an empty queue.

You may assume that the TOWNS stack is inputted and a new empty queue named

TEMP is initialized. You must use stack access methods and queue access methods in

your response. $[5]$I