5- The following picture shows a part of UT campus map. Write a prolog program to find all acceptable coloring of UT map such that connected buildings have different colors. If two buildings are connected indirectly, the can have a same colors. For example, GR and JO should have different colors, while GR and FN could have the same color. Please note that your program should color the map using minimum number of colors.