Overall paper wasn't difficult dont stress divasss Q1: A tree with n nodes has how many: a) Links b) Internal Links c) External Links d) External Nodes Q2: In the dynamic equivalence problem, Si ∪ Sj = Sk (where S is the name of the set): a)What is this operation called? b)What is its functionality? Q3: Given values 1, 5, 4, 7 and hash function h(x) = (x+3) % 4, apply linear probing and show the array indices. Q4: In Max Heap and Min Heap, where are the largest and smallest elements stored respectively? Q5: An AVL tree was given; delete node 85 and rebalance the tree. Q6: Given the array 58, 48, 78, 64, 12, 98, 99, 100... f