Please show work. Thank you!

1. Assume an directed graph G with six vertices. What's the minimum possible number of edges in the graph?

2.Select the main purpose of the following pseudocode.

1. Algorithm DoSomething (A[0...n-1]) 2. v1 A[0] 3. i 1 4. while( i < n) do 5. v1 v1 + A[i] 6. i i + 1 7. return v1

A. Find a sum B. Find a min C. Find a max D. Find an average E. None of these