N items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed.

An algorithm performs the following operations on the list in this order: $\mathrm{\Theta}\left(N\right)$delete, O(logN) insert, O(logN) find, and $\mathrm{\Theta}\left(N\right)$decrease-key. What is the time complexity of all these operations put together?