Please only give high-level ideas. And the solution possibly needs to use the tool (Straen) and property of adjacency matrix

(20 points) We are given a directed graph on n vertices. Design a o(n3) algorithm (note that this is little-o) that counts the number of triples (vi, v2, v3) such that viv2, v2v3,vzv1 are all edges