(elist all of the nodes in the path to each of the following nodesi ii iii iv (fconsider node and list the node'si descendants ii ancestors iii siblings (gidentify the depth of each of the following nodesi ii iii iv determine the arithmetic expression represented by each of the following expression trees+/xx aa yy /bb (axx ( ( build the expression tree for each of the following arithmetic expressions( ( bc (ba ( cd ( ( ( zv (dv (ea consider the following set of values and use them to build heap by adding one value at time in the order listed (amin-heap (bmax-heap prove or show that the worst case time of the extraction operation on heap implemented as an array is (log prove or show that the insertion and extraction operations on heap implemented as python list is (nin the worst case also show that each operation has an amortized cost of (log