Creating a code that is able to run both varations will be helpful and not just print it (using C++ ) will rate postive and comment

25 points Long Answers 1. Write a C++ program (along with helper functions) that takes an unordered array of integers (with at least one value) and swaps the smallest value with the first element of the array. If the smallest value appears several times, then the last occurrence (going left-to-right) will be the one moved to the front. (Example) const int size = 5; int arr(size) - {11, 22, 22, 4, 42): smallToFrontare, size); Warp=14, 22, 22, 11, 42) (Example) const int size 15; int arr[size] - 190, 21, 22, 21, 42, 11, 22, 11, 10, 11, 90, 10, 14, 15, 55): smallToFrontarr, size): Marr 10, 21. 72. 21, 42, 11. 22, 11, 10, 11, 90, 90, 14, 15, 55) . A that each mw. column, and