Please answer with steps and figures

Let A be the NN adjacency matrix of an undirected unweighted network, without self-loops. Let I be a column vector of N elements, all equal to I. In other words, I=(1,1,,1)T, where the superscript T indicates the transpose operation. Use the matrix formalism (multiplicative constants, multiplication row by column, matrix operations like transpose and trace, etc., but avoid the sum symbol ) to write expressions for: - The vector k whose elements are the degree ki for all nodes i=1,2,,N - The total number of links L in the network - The number of triangles T present in the network - the vector knn whose element is the sum of degrees of node is neighbors