in python
17. (10 points) Write a function that receives a heap H a nd an integer k and returns the number of elements in H that are smaller thank 18. (6 points) Con sider the following code fragment. Show the configuration of T after the code is executed. T DisjointSetForest (8) union(T, 7, 0 union (T, 1 ,6 union(T, 3 , 0 ) union(T, 0, 6) union(T, 3,4) union(T, 2 ,
PayPal Gateway not configured
PayPal Gateway not configured