1. Calculate pearson correlation for a simple undirected network with nodes A, B, C, and D, and edges (A-B), (A-C), AND (B-D)

2. Topologically sort the following directed acyclic graph (DAG):
Vertices: A, B, C, D, E
Edges: A→B, A→D, B→C, B→E, D→E

---