Write a program in C++ with the following requirements: 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, dont maintain the game entries in order. Assume that we still need to keep n entries stored in indices 0 to n 1. Implement the add and remove functions without using any loops, so that the number of steps they perform does not depend on n.

Please help me out and explain. ALL YOU HAVE TO DO IS EDIT THE ADD AND REMOVE PROGRAM IN IN THE PICTURE AND REDO IT WITHOUT LOOPS TO ADD AND REMOVE. PLEASE AND THANK YOU.

Assignment 3 advises for implementation of the remove function. You have to release the memory for the deleted entities, so it can be used again when you add new ones. To release the memory you can use the schema below