Must be in JavaScript

You may not use external libraries in your code unless explicitly stated. 1 Graph Representations Implement a function that converts an adjacency list to an adjacency matrix for a directed unweighted graph. It should have the following signature: function convertToAdjMatrix(adjlist); Submit your complete code, including a function that demonstrates that your implementation works with a few test inputs. Total 6 points. 2 Runtime Analysis What is the runtime complexity of the conversion that you implemented? Does it depend on the number of vertices, the number of edges, or both? What would the time complexity of a conversion function from adjacency matrix to list be? Submit a PDF document describing your reasoning and the answers. Your reasoning is the most important part. Total 4 points. Testing I'm not giving you the code to test your implementation this week because it contains the solution, but you are encouraged to write testing code yourself