In this problem, we need to decide whether there is a feasible plan for all the persons in a building to escape when they meet some emergency issues. More specifically, a building is described as an n by n grid and the position of p persons are represented as the integer points (x1, y1), .., (xp, yp) in the building. Note that to ensure safety, we don’t allow any intersection between the paths of any two person. Therefore, your task is to decide whether there exist p vertex-disjoint paths from their starting points to any p different points on the boundary of the grid. Give an algorithm polynomial in n and prove the correctness of it.

the line of

median is the value separating the higher half of a data sample, a population or probablity distribution from the lower half.

step-by-step explanation:

say you have 3,8,7,3,1,9,8 order them from lowest to highest

if orderd it would be 1,3,3,7,8,8,9 now you take away from the lowest and the highest until you end up in the middle.

so you would remove the 1 and 9 leaving you with 5 digits remaining

when you've reached the middle that would be your answer so in this case the answer is 7

if there were two numbers left say 7 and 5 you'd and them together so 12 then divide by 2 witch would equal 6 so the answer would be 6

good luck on that project hoped i you at all