\(change\Pr iority\left(item,\ new\Pr iority\right)\){
1. pos \(\leftarrow\) AVL.search(item) // look-up reduced from O(n) to O(logn)
2. swap A[pos] with A[size] // swap with last element
3. Update AVL Tree for A[pos] //swapped element has changed its index position so need to update AVL tree
4. remove A[size] from Priority Queue
5. AVL.remove(item)
6. addItem(item, newPriority)
Time Complexity Analysis:
Space Complexity Analysis: