note : you must follow the steps in the given pseudocode don't use other insertion algorithms

The pseudocode below describes an algorithm that inserts an integer x in the appropriate position into the list 01,22...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, 01, 02,...,an: increasing integers) 2 an+1 :=x+1 3 i:=1 4 while x > 5 i:=i+1 6 for j := 0 to n-i 7 an-j+1 := An- 8 a:=x 9 {x has been inserted in the correct position)