Search for the goal using 1. Breadth First Search 2. Depth First Search 3. Heuristic Function (invent your own heuristic function) Compare between the 3 paths using the 3 different algorithms.

Implement an intelligent algorithm in prolog to solve the 44 sudoku. Represent the board using a list of 16 digit. (use _ as a placeholder for empty tiles) For example: \[ \text { [_,_, 1,_, 3,_,_, 2,_, }, 2,4,2,4, \ldots,] \] You MUST Implement the following rules: you may need to add extra rules to support the previous rules. Search for the goal using