Using C++ Implement the ordered version of removeElement in the window below. Your function should validate inputs and remove the element in the given position by moving all of the other elements...

Using C++ Implement the ordered version of removeElement in the window below. Your function should validate inputs and remove the element in the given position by moving all of the other elements down.

// removeElement preserves the order of the remaining elements in the array.
// @param: char array that is ordered in some way.
// @param: int numElems is the number of elements
// @param: int position of the element being removed
// @returns true if the element is removed, false otherwise.
// be careful to use reference parameters where necessary!

Extracted text: INPUT OF THE TEST CASE 1 const int MAX_CHARS=20%; 2 char al[MAX_CHARS] char a2[MAX_CHARS] { "a', 'b', 'd', 'e', 'f', "\0' }; { 'a', 'b', 'c', 'd', 3 'f', '\0' }; 4 int numElems = 7; ASSERT_TRUE (removeElement (a2, numElems, 2)); ASSERT_TRUE (numElems == 6); ASSERT TRUE (std::equal (al, al+6, a Rotate Left 8. Search const int MAX_CHARS=20; 2 char al[MAX_CHARS] = { 'a', "b', 'c', 'd', 'e', 'f', '\0' }; 3 char a2[MAX_CHARS] = { 'a', 'b', 'c', 'd', 'e', 'f' }; 4 int numElems 5 ASSERT_TRUE (removeElement (al, numElems, numElems-1)); 6 ASSERT TRUE (numElems ASSERT_TRUE (std::equal(al, al+6, a2)): - 7; 6); Q Search INPUT OF THE TEST CASE 1 const int MAX_CHARS=20; 2 char al[MAX_CHARS) 3 char a2[MAX_CHARS] { 'a', 'b', 'c', 'd', 'e', 'f', '\0' }; { 'a', 'b', 'c', 'd', 'e', 'f', '\0' }; 4 int numElems = 7; ASSERT_FALSE (removeElement (al, numElems, numElems)); ASSERT TRUE (numElems == ASSERT TRUE (std::equal(al, al+7, a2)); 5. 7); 7 8. Search INPUT OF THE TEST CASE 1 const int MAX_CHARS=20%3; { 'a', 'b', 'c', 'd', 'e', { 'a', 'b', 'c', "d', 'e', 'f', '\0' }; 'f', '\0' }; 2 char al[MAX_CHARS] 3 char a2[MAX_CHARS] int numElems = 7; ASSERT_FALSE (removeElement (al, numElems, -1)); %3D 4 5. 6 ASSERT TRUE (numElems 7); 7 ASSERT_TRUE (std::equal(al, al+7, a2)); 8.