Problem $3.$ The following is an algorithm for solving SSSP in a directed acyclic graph. It assumes that the graph $G$ is a directed acyclic graph. Recall that a topological sort of $G$ is an ordering of its nodes $v_1,v_2,$dots,$v_n$ so that if $(v_i,v_j)$ is one of the directed edges in $G,$ then $|E|=(|V|)i.$ for each node $\frac{?}{(u/inV/)}$ taken $in$ topologically sorted order $do$ for $\frac{?}{(v/in/operatorname\{Adj\}[u]/)}do\frac{?}{(/operatorname\{Relax\}(u,v,w)/)}$ end for end for

$a$