Graphs and Degrees · Hard problem

In the complete bipartite graph $K_{4,6}$ (left side $L_1,\ldots,L_4$, right side $R_1,\ldots,R_6$), how many walks of length $2$ go from $L_1$ to $L_2$ (two DIFFERENT vertices on the same side)?