Select true / false statement in regarding to graph representation:

a. If our task is to process vertices adjacent to a vertex v, then the adjacency list requires only deg(v) steps, whereas the adjacency matrix requires |V| steps.

b. Inserting or deleting a edge requires linked list maintenance for an adjacency list (if such an implementation is used); for a matrix, it requires only changing 0 to 1 for insertion, or 1 to 0 for deletion, in one cell of the matrix.