A Priority Queue is implemented with a Min Heap that has ins…

A Priority Queue is implemented with a Min Heap that has instance variables of an array to hold the data and an integer to store the current size.  What would be the algorithmic complexity of the following operations using this standard MinHeap?  peek   [blank1] add  [blank2] remove [blank3] isEmpty [blank4]