llo 19, (1) In an array based FIFO queue, can rear front, why? 2) Why do we need to check if a FIFO-Queue is full when we use an array to implement the FIFO-Queue? 3) Do we need to check if a FIFO-Queue is full if we use a the FIFO-Queue? double linked list to implement 20. A priority queue can be built from a sorted array or a heap. Which one would you use? Why? 21. A dynamic dictionary can be built from a sorted array or a binary search tree. Which one would you use? Why? 22. Given the adjacency matrix of an un-directed, weighted graph G- (V,E), where V-f a, b, c, d, e, f, E is the set of the edges that connects the vertices. Construct the adjacency matrix