Consider the following randomized algorithm A that takes as input a graph G and determines whether G contains a clique of size 3, i.e. three mutually adjacent vertices: 1. Choose three vertices in G at random. 2. Check whether these three vertices form a clique. If so, return yes and halt. Otherwise, return no and halt. If G has n vertices, how many times should you run A on G to get a correct answer with a probability of error less than 0.5? Hint. Use the following inequality known from Calculus: [1 1/ x]^x < 1 /e for all x 1.