Question 18How many routes with the minimum number of moves lead from A to B in the grid? A move may go to any neighbouring square, including diagonally. 4352