1. Perform a depth-first search of the Australia digraph given below, starting at Sydney. List the order in which the cities are processed. - Do the same for a breadth-first search. Darwino Fly...

Note: Need this java lab with output and source code and do not copy from any other sources do it by yourself

Extracted text: 1. Perform a depth-first search of the Australia digraph given below, starting at Sydney. List the order in which the cities are processed. - Do the same for a breadth-first search. Darwino Fly Crocodile Airlines Black Stump Brisbane Canberra Sydney Perth Adelaide Melbourne Hobart 2. Consider the graph below. Write a program that outputs the shortest distance from node 0 to every other node in the graph. 3 1 12 8. 15 5 5. 4 3 3. 2. 2.