FOR JAVA

1. Given a rectangular field with few sensors present on it, write a program to cross it by taking the shortest safe route without activating the sensors. Sensors are marked with 0. For example: consider the below matrix The shortest safe path has length of 11 and the route is marked in Hint: Find shortest path from any cell in first column to any cell in the last column of the matrix. 2. Given an edge weighted graph, write a java program named Path.java that will: a. Given a source vertex, find shortest paths from source to all vertices in the given graph. b. If the graph is directed, then find shortest distances between every pair of vertices