Graphs and Degrees · Easy problem

Graph $H$ has vertices $a,b,c,d,e$ and edges $ab, ac, ad, bc, be, cd$. How many walks of length $2$ go from $b$ to $d$ (note: $b$ and $d$ are not directly adjacent)?