please show answers with explination and please notice that Algorithms must be written using pseudo code emphasizing the notation (meta-language)

Data structure

20)ln class we implemented a link allocated queue subject to the boundary conditions E= and setting R := Location(F) when empty. Write an algorithm to remove the last item in the queue effectively creating an input restricted deque (can remove from both ends but only insert on 1 end the rear) Observe all boundary conditions including underflow and overflow. queue/deque represents a customer list. The sample Info List Partial Customer! F | Joe | Sam | Mary | | R If (F2 ) Underflow locate node preceding last node While (punk+ ) loop End loop Else Y pt2. info pt2 => avail (delete) if (pt= E)-deleting only node in list Else -more than one item in list End if End if 24)Assume a bounded linearly allocated circular deque of M+1 items as described below Bounded Linearly Allocated Circular Queue Joe Sam Mary The above diagram reflects the contents after inserting three items. We assume the boundary condition that F -R -0 initially. Traditionally we have considered the queue as empty anytime F R. Write an algorithm to remove the item at the rear of the deque (pointed to by R). Your algorithm must detect and report underflow as efficiently as possible 20)ln class we implemented a link allocated queue subject to the boundary conditions E= and setting R := Location(F) when empty. Write an algorithm to remove the last item in the queue effectively creating an input restricted deque (can remove from both ends but only insert on 1 end the rear) Observe all boundary conditions including underflow and overflow. queue/deque represents a customer list. The sample Info List Partial Customer! F | Joe | Sam | Mary | | R If (F2 ) Underflow locate node preceding last node While (punk+ ) loop End loop Else Y pt2. info pt2 => avail (delete) if (pt= E)-deleting only node in list Else -more than one item in list End if End if 24)Assume a bounded linearly allocated circular deque of M+1 items as described below Bounded Linearly Allocated Circular Queue Joe Sam Mary The above diagram reflects the contents after inserting three items. We assume the boundary condition that F -R -0 initially. Traditionally we have considered the queue as empty anytime F R. Write an algorithm to remove the item at the rear of the deque (pointed to by R). Your algorithm must detect and report underflow as efficiently as possible