Consider the following problem: Maze Traversal - Breadth first Search Help Tom (in square A4) to catch Jerry (in square C3). However, tom goes only one step at a time, avoiding obstacles (Black Squares). The operators are to be used in this order: go-left, goright and go-down. Each operator costs 1. Solve this problem to find the Tree, queue, path by using: - Depth First Search - Depth limited Search with a depth bound =4