Please help with this algorithm question....Thanks

An n n grid is an undirected graph with n2 vertices organized into rows and n columns. We denote the vertex in the ith row and the jth column by (i,j). Every vertex in the grid have exactly four neighbors, except for the boundary vertices, which are the vertices (i,j) such that i 1,i n, j-1, Let (?, yi), (z2,U2), .. ., (Tm, y,n) be distinct vertices, called terninals, in the n n grid. The escape problem is to determine whether there are m vertex-disjoint paths in the grid that connect the terminals to any m distinct boundary vertices. Describe and analyze an efficient algorithm to solve the escape problem. A positive instance of the escape problem, and its solution