Convert the given diagram to a graph so that a node is connected to another node if only if the corresponding regions have a border berween them. (3 marks] (Draw graph here) 3 7 3 6 5 q 02) Now color the graph in a way so that no adjacent nodes share the same colot. You can use maximum four colors (Red, Green, Blue, Yellow). You must use Minimum Remaining Value heuristic followed by Degree heuristic followed by numeric order to choose the order of nodes. Show your work la particular, the order of the nodes must be clearly mentioned. [7 marks)