Instead of implementing a Priority Queue with a heap, imagin…

Instead of implementing a Priority Queue with a heap, imagine that a sorted ArrayList is used instead, with the largest item at the front.   What would be the algorithmic complexity of the following operations using the sorted ArrayList implementation ?  peek   [blank1] add  [blank2] remove [blank3] isEmpty [blank4]