This is a simple constraint solving exercise, involving techniques covered in the context of supply chain optimization. Consider a map with the following adjacency relations: CountryA and CountryB share a border CountryA and CountryC share a border CountryB and CountryC share a border CountryB and CountryD share a border CountryC and CountryD share a border CountryC and CountryE share a border CountryE and CountryF share a border CountryE and CountryG share a border CountryF and CountryG share a border CountryG and CountryD share a border The problem is to assign a colour to each country on the map so that no two adjacent countries have the same colour. Formulate this problem as a constraint satisfaction problem by identifying: (1) the decision variables; (2) the domain for each variable; (3) the applicable constraints. Now consider the problem of minimizing the number of colours used. Formulate this as an objective function. What is the minimum number of colours that can be used to colour this map while satisfying the constraint described above.