Can anyone help me understand the worst-case time complexities of these problems? Any advice is greatly appreciated. Thanks!

For each of the operations listed below, determine the time complexity of the operation. Select the bubble corresponding to your choice in the space provided. Unless otherwise stated, assume the worst-case time complexity. However, make sure you choose the tightest Big-O upper bound possible for the operation. Do not use an amortized analysis for these operations unless otherwise specified. A) Average case of adding to a skip list with a coin with tails on both sides (recall: tails promotes a node). O (1) OO(log n) O(n) (n log n Oo(n2) B.) Running BuildHeap on an array sorted in ascending order to turn it into a Min Heap. 00(1) Oo(log n) OO(n) OO(n log n) Oo(n2) C.) Average case of adding to a hashmap using linear probing where the hash function always returns 0. O (1) OO(log n (n) OO(n log n O o(n2) D.) Average case of remove0 in a Max Heap. O01 (logn) o(n) o(n log n)(n2) E.) Runtime of finding the height of the root node in an AVL tree. O (1) OO(log n) O(n) (n log n Oo(n2)