CMIMC 2017 Computer Science Problem 10

How many distinct spanning trees does the graph below have? Recall that a spanning tree of a graph G is a subgraph of G that is a tree and containing all the vertices of G.