(10 pts.) Give a trivial lower bound for the following problem: INPUT: adjacency matrix M of a graph G OUTPUT: true iff G is a complete graph. Show that your bound s tight by providing an algorithm to solve this problem using the same time bound