The adjacency matrix of a directed graph:

(a) May have diagonal entries equal to 1

(b) May be symmetric

(c) May not be symmetric

(d) May be difficult to understand