NOTE:
- Your time complexities should be expressed in big-O notation and be in
  terms of n, where n is the number of cells in the maze.

============
  solveBfs
============

- Worst case time complexity: O(...)

- Explanation: ...

============
  solveDfs
============

- Worst case time complexity: O(...)

- Explanation: ...