3. Which algorithm is faster? Justify your answer using Big-Oh notation. Use the editor to format your answer Question 5 5 Points Let G be a disconnected graph with n vertices where n is even. If G has two components each of which is complete, prove that G has a minimum n(n - 1)/4 edges. - Use the editor to format your answer 103 minutes remaining