Using the flight map below and a stack, determine if a fligh…

Using the flight map below and a stack, determine if a flight path exists from city  H to city I.  Write your answer in the textbox below.  It is only necessary for your answer to show one route, if it exists.  Show the state of the stack after each step. (2 points)   For example if the question asked: Does a flight path exist from city C to city G? Your answer could be written like this: Yes a path from city C to city G exists, the resulting stacks are C, DC, HDC, GHDC.  

Copy the empty toString() method given below, paste it into…

Copy the empty toString() method given below, paste it into the text box below, and then write the body of the method so that it returns a String containing the item data field values for all of the nodes in a linear linked list.  Assume that the item data field is of String data type and that both item and next data fields in the Node class are private  meaning that you should invoke the .getItem() and .getNext() methods on the nodes. (5 points) public String toString() { }