The following algorithm checks whether or not there exists a path on the graph from the starting vertex to the given end vertex. Convert the algorithm to proper Java code: Algorithm: IsPath (startVertex, endVertex): returns boolean 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

3. The following algorithm checks whether or not there exists a path on the graph from the starting vertex to the given end vertex. Convert the algorithm to proper Java code: Algorithm: IsPath (startVertex, end Vertex): returns boolean 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