the value of A[4] is changed to 27. What is the running time, upper bound in terms of O(*) of MAX HEAPIFY. 5 points Q-3:

[answerhappygod]

The Value Of A 4 Is Changed To 27 What Is The Running Time Upper Bound In Terms Of O Of Max Heapify 5 Points Q 3 1 (46.91 KiB) Viewed 11 times

the value of A[4] is changed to 27. What is the running time, upper bound in terms of O(*) of MAX HEAPIFY. 5 points Q-3: Store this array A = {-5, 3, 5, 17, 15, -45, 17) as a Hash Table using the function hl(key)=key % 11) and the following collision resolution function: (1) with linear probing. h2(key, i) = (key+ i)% 11. i=number of collisions recorded for that key and h2 is invoked in the event of a collision. (2) With double hashing h2(key, i) = (hl(key) +i) % 7 where i = number of collisions for that key and h2 is invoked in the event of a collision. (3) With quadratic hashing h2(key.i) = (h1(key) + 3*i+3*i² ) %11 15 points Q-4: What are the advantages and disadvantages of using a Linked List as a data structure vs, using an array?