Breadth First Search
1. Which of the following are applications of BFS?
2. Imagine a 4X4 grid (assume 1 indexing) where the hero stands in the cell (2,3) and the villain is in the cell (3,1). Assuming the hero can only move up, down, left and/or right to the immediately adjacent cells and cannot move out of the grid, how many steps will it take for the hero to reach the villain (given that the villain is stationary)?