Graph Algorithms · Medium problem

A graph has vertices $a,b,c,d$ and possible edges $ab, bc, cd, da, ac$ (so one diagonal is included). How many DIFFERENT spanning trees does this graph have in total (using any $3$ of the $5$ edges, not necessarily of minimum weight)?