Problem
Give Java code for performing add(e) and remove(i) methods for game entries, stored in an array a except now don't maintain the game entries in order. Assume that we still need to keep n entries stored in indices 0 to n - 1. Try to implement the add and remove methods without using any loops, so that the number of steps they perform does not depend on n.