A Poor Upper Bound We an compute a simple upper boundonthe ngtime of BUILD-MAX- HEAP as follows.Each call to MAX-HEAPIFY costs (g)time,and BUILD- MAX-HEAP makes (n)such calls.Thus,the running time is O(n).This upper bound,thougis ot asymptotically tight. 间题7： 为什么这个Bound不很好？A Poor Upper Bound