Consider the given map of the divisions of Bangladesh. Convert it to a suitable graph, and color them using maximum four colors $($Red$,$ Green, Blue, Yellow$)$ so that no two adjacent divisions have the same color. You can use Backtracking$/$ Forward checking.

You must use Minimum Remaining Value heuristic followed by Degree heuristic followed by alphabeticaler to choose the order of nodes. Show your work. In particular, the order of the nodes must be clearly mentioned.l