Please show your work, and I will upvote right away for the correct answer!

This question is about graph theory. Consider a rooted tree (T. r) where T = (If; E) is an undirected tree with nodes 1' = {(1, b, c, d} and o, is the root. Here are oH' of the topological sorts of this directed acyclic graph: I a.d,b.c I' a.c.d,b II o.d,c,b List the edges in E and 'lustitg your answer. Hint: A rooted tree can be seen as a digraph where the digraph is a directed acyclic graph {DAG} with the root as the only source