Q2) Write a method IsPathDF (startVertex, endVertex): returns Boolean, that checks if there exists a path from the starting index to the ending index.

Hint: turn the following pseudocode to Java code.

Set boolean found to false

Clear all marks

Create queue

If startVertex == endVertex, return true else

Mark the startVertex

Store all adjacent vertices to startVertex in queue do

Dequeue adjacent vertex and store in temp

if temp is not marked

Mark temp

Check if there is a path from temp to endVertex while !queue.isEmpty()

return found