Consider the following representation of a web as a graph. Mark the *true* statement with regards to the hub score h(N) and the authority score a(N) for each node N after one iteration (iteration 1).

Iter0 Iter1
h(N) a(N) h(N) a(N)
A 1 1 0 2
B 1 1 1 2
C 1 1 1 1
D 1 1 3 0

Which of the following statements is true?
1) a(A) > a(B), and h(b) = h(C)
2) a(A) = a(B), and highest h(N) is for N=D
3) a(C) = a(D), and highest h(N) is for N=B
4) h(B) > h(A), and highest a(N) is for N=D