The pseudocode below describes an algorithm that inserts an integer x in the appropriate position into the list an,a2, ...a, of integers that are in increasing order. Use the pseu- docode to write a C++ program that implements and tests this insertion algorithm. Note: YOU MUST FOLLOW THE STEPS IN THE GIVEN PSEUDOCODE. DO NOT USE OTHER INSERTION ALGORITHMS. Pseudocode: Insert Value Algorithm 1 procedure insert (x: integer , aj, a2,...,an: increasing integers ) 2 an+1 :=x+1 3 i:=1 4 while x >d; 5 6 for j := 0 to n-i 7 Qn-j+1=an-, 8 0;:=x 9 {x has been inserted in the correct position)