Create a function sortAscending$()$ which sorts an numeric array in ascending order. This function should fulfill the following requirements

The input to the function can be either a row vector, a column vector or a scalar $($of numeric data types$)$ othervise the function returns empty array $([].$

If the input is a row vector. the function returns a row vector. if the input is a column vectors. the function returns a column vector scalar input returns a scalar output.

If not empty, the output array is arranged in ascending order. i$.$e all elements in the array are arranged in a series that begins with the least or smallest and ends with the greatest or largest.

You are NOT permitted to use the built$-$in sort $()$ function.

You can use any algorithm you know to solve this problem. Here we provide the pseudo$-$code of two methods: bubble sort and selection sort.

Bubble sort:

$x=$ Input

for $i=1$ : length $(x)$

for $j=1$ : length $(x)-i$

do: swap $x(j)$ and $x(j+1)$ if $x(j)>x(j+1)$

end for

end for

return $x$

Selection sort:

$x=$ Input

for $i=1$ : length $(x)$

do: initialize min$\_$idx $($index of minimum element$)$ as i

for $j=i+1$ :length $(x)$

end for

do: swap $x(i)$ and $x($min$\_$idx$)$ if i not equal to min$\_$idx

end for

return $x$

Function

$\backslash$table$[[1,$function $[$res$]=$ sortascending$($input$)],[2,]]$