Question 3 (a) Write using pseudocode the implementation of the method insertBefore(p.e) for a doubly linked list. (b) Design an algorithm that takes two sorted queues (maximum value at the front and finds the number of same elements between the two and returns the quenes as they were at the beginning. w (c) Design an algorithm that takes two sorted stacks (maximum value at the top) and finds the number of same elements between the two and returns the stacks as they were at the beginning