Consider the following ArrayList implementation of a queue:

public class ArrayListQueue $\{$

private ArrayList queue;

public ArrayListQueue$()\{$ queue $=$ new ArrayList$()$; $\}$

public E dequeue$()\{$ return queue.remove$(0)$; $\}$

public void enqueue$($E element$)\{$ queue.add$($element$)$; $\}$

public E peek$()\{$ return queue.get$(0)$; $\}$

$\}$

Why is this implementation inefficient? Would the complexity have been better if we had made the front of the queue be at the end of the ArrayList and the rear of the queue be at the front of the ArrayList?