Applying Kruskal's algorithm we will select edges $(b,c)$ and $(e,f).$ Then we'll choose $2$ from the $3$ edges with weights $7$ each - $3$ choices. Then either $(a,b)$ or $(a,f)$ is selected to complete the MST. Thus we have $3 \times 2 = 6$ possible MSTs.