* Consider the following List ADT operations (where the p;'s represent positions) p1-insertFirst(8), p2-insert After(p,5), p3-insert Before(p23), p4-insertFirst(9), remove(p4), swapElementa(p1,P2), replace Element pa, 7), Ps-insertAfter(first0,2) Which of the following options describes the final list in a correct way? (8,5,3,9) (5,7,3,2) 5,2,7,8) (3,7,5,9 * Which of the following chronological sequences of node names does not correctly represents a traver- sal of the tree to the right that corresponds to a preorder or inorder or postorder traversal? A,B,D,E.H,J,C,F,K,G D,H,J,E,B,K,F,G,C,A A,B,E,H,J,K,D,C,F,G D,B,H,E,J,A,K,F,C,G * Which of the following options list the functions in correct non-decreasing order if they are compared by asymptotic growth? log n,n,n log n, nlog n, n 7n,2, n, n! logn,n,n logn, n log n, n n2, n!, n" .log n,n, n log n, n2 +log n, n +7n5, n!, 2n n . logn,n,n log n,n n7n nlog n, 2n, n, n! * What is the correct sequence of insert and/or removeMin operations on heap A that will transform it into heap B (as shown below)? 20 25 12 insert(7), removeMin) e removeMin), removeMin), insert (3) removeMin), insert (3) removeMin), insert (3), insert