2. Mixed Bag: This question concerns several different data structures topics in one question. the position of the front (0) and rear (4) of the queue in the array. illustrate your answer. [ one time) i) Identify and describe the problem with this implementation. [4]ii) Identify and describe an approach to resolve this problem whilst retaining an underlying fixed-size array. You can use diagrams as necessary to help illustrate your points [4](c) The acronyms FIFO and LIFO are used to describe list-like data structures. Expand these acronyms and explain which is relevant for a queue. linked list. Indicate your preferred choice, in the following scenario, along with clear justifications: timestamp. Which of the two suggested data structures would be most appropriate and why