Give C++ code for performing add(e) and remove(i) functions for game entries stored in an array a, as in class Scores in Section 3.1.1, except this time, 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 functions without using any loops, so that the number of steps they perform does not depend on n.

PLEASE IN C+++ - IN C++
PLEASE IN C+++ - IN C++
PLEASE IN C+++ - IN C++
PLEASE IN C+++ - IN C++