In the last homework, we gave an algorithm to check whether a graph has a triangle in an undirected graph in O(n 2 +nm) time, which is Θ(n 3 ) when the graph is dense. Show how given a graph G in...

In the last homework, we gave an algorithm to check whether a graph has a triangle in an
undirected graph in O(n²
+nm) time, which is Θ(n³) when the graph is dense. Show how given a graph

G in adjacency matrix representation, it is possible to use Strassen's matrix multiplication algorithm
 to determine if the graph has a triangle in time o(n³).  (You can use the algorithm
without description or proof, but you must explain connection to the existence of a triangle in the graph).