Scenario: Suppose the array in a class you are programming c…
Scenario: Suppose the array in a class you are programming could become full. Programming Goal: We need to make a new array and copy the contents of the old array to the new array that is twice the size, while avoiding memory leaks. Code Ordering: The potential lines of code below are each shown with a number. Arrange the code below in order by filling in the blanks with the number of the code. All lines of code may not be used. Some lines of code could be used more than once. For example, if you think code number X should happen first, enter that integer in the first blank. If you think code number X should happen second, enter that integer in the second blank. And so on. When finished, each blank below should have one integer in the blank, which orders the code. (Enter only an integer, not the dot beside the integer–i.e. 10 not 10.) 1. arr = temp; 2. capacity *= 2; 3. delete; 6. for (int i = 0; i < size; i++) temp = arr; 7. for (int i = 0; i < size; i++) temp = arr; 8. int* temp = new int; 9. for (int i = 0; i < size; i++) temp = arr; 10. *arr = temp; 11. delete = temp; 14. temp = arr;