Answer the following questions TRUE or FALSE. Don't supply an explanation or proof. a) Every DAG is a Directed Forest. b) Every Directed Forest is a D c) In a Directed Tree, there is a path from every vertex to every other vertex. d) Suppose that you search a Directed Graph using DFS from all unvisited vertices, coloring AG. edges red if they go between vertex v and an outgoing neighbor of v that you visit for the first time from v. Then the red edges form a Directed Forest. e Suppose that you search a Directed Graph using BFS from all unvisited vertices, coloring edges red if they go between vertex v and an outgoing neighbor of v that you visit for the first time from v. Then the red edges form a Directed Forest. f) Suppose that a Directed Graph is Strongly Connected, and you search that Directed Graph using DFS starting from any vertex, coloring edges red if they go between vertex v and an outgoing neighbor of v that you visit for the first time from v. Then the red edges form a Directed Tree