Let the adjacency matrix for a graph of four vertex {n1 to n4} be as follows

$A = \begin{matrix} \ 0& 1 & 1 & 1\\ \ 0 & 0 & 1 & 1\\ \ 1 & 0 & 0 & 1 \\ \ 0 & 0 & 0 & 1\\ \end{matrix} $

Calculate the authority and hub scores for this graph using the HITS algorithms

With k=6 and identify the best authority and hub nodes