Design and analyze a transform$-$conquer algorithm for counting the number of triangles $($cycles with three edges$)$ in a graph by reducing it to the problem of matrix multiplication.