you play simplify PACMAN game infinite 2D grid you start point 0 0 give destination point target xtarget ytarget try there ghost map start position give 2d array ghost ghostsi xi yi represent start position ith ghost all input integral coordinateseach turn ghost independently choose 1 unit cardinal direction north east south west stay all action happen simultaneouslyyou escape reach target ghost reach if reach square include target time ghost count escapereturn true possible escape regardless ghost return false example 1input ghost 1003 target 01output trueExplanation you reach destination 0 1 1 turn ghost locate 1 0 0 3 catch youexample 2input ghost 10 target 20output falseexplanation you need reach destination 2 0 ghost 1 0 lie destinationexample 3input ghost 20 target 10output falseexplanation the ghost reach target time Constraints1 ghostslength 100ghostsilength 2104 xi yi 104There multiple ghost locationtargetlength 2104 xtarget ytarget 104