NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Consider the directed multigraph. Click and drag the vertices (in the right column) to their number of out-degree (in the left column). 1 2

Q8 correct answer

What is the maximum number of edges that can be present in a graph, that has 10 vertices, and has a valid vertex coloring with only 3 colors?

Wouldyou use the adjacency list structure or the adjacency matrix Strijc each of the following cases? Justify your choice. a. The graph has 10,000 vertices and 20,000 edges, and it is importan as little space as possible. b; The graph has 10,000 vertices and 20,000,000 edges, and it is impo use as little space as possible. c. You need to answer the query arëAdjacent as fast as possible, no how much space you use.

Bresenham's circle drawing method requires p's value. Bresenham's circle-making directions are offered.

Please make a graph by hand for each step. no code

Please don't use answer already posted on other websites. will leave you feedback!! Thank you!

Refer to attached images and provide correct solutions!