<s>[INST] A First-In-First-Out (FIFO) queue is a data structure that operates based on the principle of "First Come First Served" (FCFS). 
Let's say we want to implement a queue using an array-based data structure. We would need to define functions to Add elements (enqueue), Remove elements (dequeue), and Peek at the first element. 

How would you implement these functions?[/INST]