Map Coloring: Solve the map coloring problem for the following Hexagonal map.

a$.$The top and bottom rows of hexagons should be sea tile.

b$.$The middle eight hexagons can be anything but sea.

c$.$No two towns can be adjacent.

d$.$Adjacency is when two hexagons share a side, e$.$g$.0,0$is adjacent to $1,0$and $0,1$

e$.$The only tile $($tile~$=$color$)$that cannot be adjacent to another of the same type is town.

tile$($town$).$tile $($sea$).$tile $($mountain$).$tile $($forest$).$tile$($desert$).$

$--$looking at map, the first four variables are $$S$00,$S$10,$S$20,$S$30$and the top four sea tiles.

solution$($S$00,$S$10,$S$20,$S$30,$S$01,$S$11,$S$21,$S$31,$S$02,$S$12,$S$22,$S$32,$S$03,$S$13,$S$23,$S$33)$:$-($CODE IN PROLOG!!!$)$