How many spanning trees exist for a graph $G$ that consists of two disjoint triangles ($C_3$ and $C_3$) connected by a single edge between them?