Triangle is a complete graph on 3 vertices (see below) You are given a graph G, and you need to calculate the number of triangles contained in G.

1.    Triangle is a complete graph on 3 vertices (see below)

You are given a graph G, and you need to calculate the number of triangles contained in G. Develop an efficient algorithm to solve this problem. What is its running time? Explain your answer