Find the number of paths of length n between any two nonadjacent vertices in K3,3 for the following values of n:

a)2 b)3. c)4. d)5

( i am able to understand the number of paths of length n between any two adjacent vertices in K3,3… but i am not able to get intuition for non adjacent in the adjacency matrix)