In Julia Code:

Problem $1-$ Graph to adjacency matrix

Write a function convert$2$adjmatrix$($g::Graph$)$ which creates a sparse adjacency matrix for the graph g$.$ That is$,$ a matrix

A

of size $|$V$|-$by$-|$V$|$ where $|$V$|$ is the number of vertices, and Aij$=1$ if there is an edge from vertex i to vertex j $($otherwise zero$).$

Make sure you do not insert elements into an existing sparse matrix. Instead, create vectors of row $/$ column indices, and call sparse once to create the matrix.