Problem 2 (5 pts) You are supposed to represent directed graphs in SQL. A directed graph consists of nodes and directed edges connecting the nodes. A node y is reachable from another node r if there is a path from r to y; directly reachable if there is a path from to y consisting of a single edge. Define an appropriate SQL schema. Write the following queries in SQL2 or SQL3: For every node, compute
OR
OR