If a directed graph is represented by the adjacency matrix, then the in-degree of the i-th vertex is:the total number of entries in the i-th rowthe total number of non-zero entries in the i-th rowthe total number of non-zero entries in the i-th columnthe total number of zero entries in the i-th column