Given a minimum-heap H, give a tight O ) bound on the time complexity of a method that finds, but does not remove, the three smallest keys in H. Assume the method creates and returns a list of the three smallest elements. To answer this question you need to think of how such a method might be implemented. O (n log (n)) O (3 log (n)) O (log (n)