Walks, Paths and Connectivity · Superchallenge problem

Let $G$ be $4$ triangles arranged in a cycle: triangle $i$ on vertices $3i,3i+1,3i+2$ for $i=0,1,2,3$, with a connecting edge from $3i+2$ to $3((i+1)\bmod4)$ for each $i$ (so the $4$ connectors themselves form a cycle through the triangles). Find the number of bridges plus the number of cut vertices.