Encode K5 as vertex/edge lists, as vertex/adjacency lists, and as an adjacency matrix. Do the same with P5. How do the different storage methods compare for these two graphs? Does this suggest any...

Extracted text: Encode K5 as vertex/edge lists, as vertex/adjacency lists, and as an adjacency matrix. Do the same with P5. How do the different storage methods compare for these two graphs? Does this suggest any general guidelines to you? Discrete Mathematics Terms: K5: A Complete graph with K vertices Complete graph: A graph that all possible edges has been drawn P5: A graph which is nothing but a path, has 5 vertices and length 4 A path: A walk with no repeat vertices A walk: List of vertices alternating with edges Length of a path: the number of edges it has