Write a NON-RECURSIVE version of this code:

This code gets the user input array and puts the even numbers first, then the odd numbers after.

#include  using namespace std; void arrange(int arr[], int n) { if (n == 0) { //checking array is empty return; } else if (arr[n - 1] % 2 == 0) { for (int i = 0; i < n - 1; i++) { if (arr[i] % 2 != 0) { int temp = arr[i]; //swapping arr[i] = arr[n - 1]; arr[n - 1] = temp; arrange(arr, n - 1); //recursive function call } } } else { arrange(arr, n - 1); //recursive function call } } int main() { int arr[30],len=0,i; cout<<"Enter number of inputs : "; cin>>len; //read size cout<<"Enter Numbers : "; for(i=0;i>arr[i]; //input numbers } arrange(arr,len); //function call cout<< " After Rearrange : "; for(int i=0;i