Using the Bush Fire Map [2 points]: 3 2 Figure 1: input heights = [0,1,0,2,1,0,1,3,2,1,2,1]. Output = 4. a Draw a graph of the regions on the map b Store the graph of this map in code c Write an algorithm in code or pseudo code to find if the map is 4-colourable d Are you using an exhaustive or greedy algorithm method? Explain. 2 points Use your code to advise each region where they can get extra fire trucks from, in an emergency. Assume the trucks are on average based in the centre of each region during fire season. Rough estimate of distance is sufficient.