Please answer to following questions Question1 (Exercise R-5.5) (20 pts) Give pseudo-code descriptions of algorithms for performing the functions insertBefore(p,e), insertFirst(e), and insertLast(e) of the list ADT, assuming the list is implemented using a doubly linked list. Question2 (Exercise C-5.11) (30 pts) Consider the following fragment of C++ code, assuming that the constructor Sequence creates an empty sequence of integer objects. Recall that division between integers performs truncation (for example, 7/2 3) Sequencecint> seq; for (int i 0; i n; i++) seq.insertAtRank(/2, i): Assume that the for loop is executed 10 times, that is, n each iteration of the loop. 10, and show the sequence after