C Programming - Please provide the code in the text.

Using C program randomly generate an undirected graph represented by adjacency matrix with n = 1000 vertices. (You may use rand function for this purpose) Determine number of edges in the graph. Determine the degree of all vertices. Show that Handshaking theorem holds. Determine the computational time in this step (except printing time) in ns (nanoseconds) Repeat step 1 and 2 for n = 2000; 3000: 4000, 5000 Draw a graph showing computational time vs n. From that graph, determine the approximate time complexity of your program as a function of n Theoretically determine the computational time complexity of your program as a function of n and compare with the time complexity found in step 4 (Find the Big O Notation of your code) Show task 4 and 5 Outputs