One of the applications of the graph-coloring problem is the traffic-light control system, where nodes are traffic turns and edges are those turns cannot perform simultaneously. Given the T-junction of the street intersection below (all streets are bi-directional), draw the graph for the traffic control system to be solve by the graph-coloring algorithm. If drawing is hard, you can just write the list nodes, and the list of edges of the graph. (5) A B C