Given an array A of size N-1 that contains all integers in the range of 1 to N, except one missing integer, write the CH code to implement an efficient linear algorithm (that is, the time complexity is 0(N)) to find the missing number. There are no duplicates in the list. Also, you may not create another array to solve this problem. You are given some initial code to start from with a simple array to check your work, but note that your solution must work for an array with any number of elements and any integers. The "?????" in the given code should be replaced by whatever variable in your code holds the missing value. #include using namespace std; int main() { int A[] = {1, 2, 4, 5, 6}; // add code to find missing number from array cout << "The missing number is: "« ????? «< endl; return 0; } Save the above code as hw2p4.cpp and add your changes to implement the requested functionality.
