solve this using declative query instead of cursor and SQL server: The data set

is comprised of two database tables:

nodes $($paperID$,$ paperTitle$)$;

edges $($paperID$,$ citedPaperID$)$;

The first table gives a unique paper identifier, as well as the paper title. The second table indicates citations

between the papers $($note that citations have a direction$).$

write stored procedures that analyze this data.

$1\mathrm{.}1$ Connected Components

You will first write a stored procedure that treats the graph as being undirected $($that is$,$ do not worry

about the direction of citation$)$ and finds all connected components in the graph that have more than four

and at most ten papers, printing out the associated lists of paper titles.