What is the time complexity for inserting an item in the array implementation of priority queues? Explain “Why”. Please, note that inserting items should be in sorted order.

Introduction:

Time complexity is a measure of how an algorithm's execution time grows as the size of the input grows. It is typically expressed in terms of the "big O" notation, which gives an upper bound on the growth rate of the running time as a function of the input size.