i. Submit pseudocode that will map any adjacency-matrix encoded in {0,1}* to an adjacency-list encoded in in {0,1}* for that matrix

ii. Submit pseudocode that will map any adjacency-list encoded in {0,1}* to an adjacency-matrix encoded in in {0,1}* for that matrix

iii. Prove that each is a polynomially-time computable function

iv. Prove that the two encodings are polynomially related