C++ ProgrammingActivity: Deque Linked ListExplain the flow of the main code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow.SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONSint main(int argc, char** argv) { DLLDeque* deque = new DLLDeque(); int test; cin test; //Declarations int tempnum; int num; int sum; int count; bool addfirst = false; bool addlast = false; bool remfirst = false; bool remlast = false; switch (test) { case 0: //Implementation do{ cin num; if(num == 0){ break; } //Reset tempnum = num; count = 0; sum = 0; addfirst = false; addlast = false; remfirst = false; remlast = false; //Sum of Digits while(tempnum != 0){ sum += tempnum % 10; tempnum /= 10; } //Rules if(sum % 2 == 0) { addfirst = true; count++; } if(sum % 3 == 0) { remfirst = true; addlast = true; count++; } if(sum % 5 == 0 && count removeFirst(); } if(remlast == true){ deque-removeLast(); } if(addfirst == true){ deque-addFirst(num); } if(addlast == true){ deque-addLast(num); } } while(num != 0); deque-final_print(); break; In the Hierarchy Problem, you are given a set of numbers. Beforeadding a number, sum up the digits of the number and consider thefollowing:• Rule of 2: If the sum is divisible by 2, add the number to thefirst.• Rule of 3: If the sum is divisible by 3, remove the first and addthe number to the last.• Rule of 5: If the sum is divisible by 5, remove the last and addthe number to the first and the last.Rule of 7: If the sum is divisible by 7, remove both the first andthe last and add the number to the first.• Rule of X: If the sum does not fall on any one of the following,add the number to the last.Statute of Limitations: If a sum is true to more than one of thefollowing, only apply two of the following rules starting fromthe first mentioned rule. You can only remove and add at mostone number from each side of the deque so if two rulescombined tells you to remove the first twice as in Rule of 3 andRule of 7, only remove one; the similar is true for adding thenumber.• Gatekeeper: If you encounter a zero (0), stop the loop.Note: Be careful in removing from an empty deque. With thisproblem, you will have to consider improving your remove methodsfor this to only return O when you attempt to remove from an emptydeque.

Question

C++ ProgrammingActivity: Deque Linked ListExplain the flow of the main code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow.SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONSint main(int argc, char** argv) { DLLDeque* deque = new DLLDeque(); int test; cin >> test; //Declarations int tempnum; int num; int sum; int count; bool addfirst = false; bool addlast = false; bool remfirst = false; bool remlast = false; switch (test) { case 0: //Implementation do{ cin >> num; if(num == 0){ break; } //Reset tempnum = num; count = 0; sum = 0; addfirst = false; addlast = false; remfirst = false; remlast = false; //Sum of Digits while(tempnum != 0){ sum += tempnum % 10; tempnum /= 10; } //Rules if(sum % 2 == 0) { addfirst = true; count++; } if(sum % 3 == 0) { remfirst = true; addlast = true; count++; } if(sum % 5 == 0 && count < 2) { remlast = true; if(addfirst == false){ addfirst = true; } if(addlast == false){ addlast = true; } count++; } if(sum % 7 == 0 && count < 2) { if(remfirst == false){ remfirst = true; } if(remlast == false){ remlast = true; } if(addfirst == false){ addfirst = true; } count++; } if(count == 0) { deque->addLast(num); } if(remfirst == true){ deque->removeFirst(); } if(remlast == true){ deque->removeLast(); } if(addfirst == true){ deque->addFirst(num); } if(addlast == true){ deque->addLast(num); } } while(num != 0); deque->final_print(); break; In the Hierarchy Problem, you are given a set of numbers. Beforeadding a number, sum up the digits of the number and consider thefollowing:• Rule of 2: If the sum is divisible by 2, add the number to thefirst.• Rule of 3: If the sum is divisible by 3, remove the first and addthe number to the last.• Rule of 5: If the sum is divisible by 5, remove the last and addthe number to the first and the last.Rule of 7: If the sum is divisible by 7, remove both the first andthe last and add the number to the first.• Rule of X: If the sum does not fall on any one of the following,add the number to the last.Statute of Limitations: If a sum is true to more than one of thefollowing, only apply two of the following rules starting fromthe first mentioned rule. You can only remove and add at mostone number from each side of the deque so if two rulescombined tells you to remove the first twice as in Rule of 3 andRule of 7, only remove one; the similar is true for adding thenumber.• Gatekeeper: If you encounter a zero (0), stop the loop.Note: Be careful in removing from an empty deque. With thisproblem, you will have to consider improving your remove methodsfor this to only return O when you attempt to remove from an emptydeque.

Accepted Answer

Initially addFirst, addLast, remFirst, remLast are false
tempnum, num, sum, count are declared as…

C++ Programming Activity: Deque Linked List Explain the flow of the main code not necessarily every line