Draw a diagram of a complete graph with 5 vertices (k5), its adjacency matrix and adjacency list representations.

Please check the attachment.

Explanation:

The adjacency matrix is the matrix that has nodes as rows and columns. The nodes if connected is stated as 1 or else 0. And the adjacency list representation is the list with nodes and connected nodes. The nodes that are not connected are not being listed. The diagram and list as well as matrix can be found in the attachment.

you have to first get good enough where you are an ace or master, then some of the creators could make you a mod. (this is pretty hard to do though)