Question 2 [50 points] WRITE IN AVA Q2.1 [10 points] Write an algorithm to randomly generate a directed graph with a given n and m and Weights[] where n is the number of vertices, m is the number of edges, and Weights[] is a list of non-negative weights for m edges Q2.2 [10 points] Use the algorithm in Q2.1 to generate three directed graphs. Each graph contains 10 vertices, and between 20-30 edges. Q2.3
OR
OR