Draw the graph into a TREE that corresponds to the following adjacency dictionary describing an undirected graph:

a:{c:1,d:5}, c:{a:1,e:12}, d:{a:5,h:8}, e:{c:12,g:7,h:4}, g:{e:7,h:3}, h:{e:4,d:8,g:3}