（是非題）If we implement a min-heap using a dynamic array, then its findMin(), insert(), and deleteMin() operations have the time complexities O(1), O(log n), and O(log n), respectively.