This is c++ code.

Create a file sort.cpp. to mixfunctions with the selection sort algorithm:

·Write a function intleast(vector strs, int start)to return the index ofthe smallest value in the vector. You are to assume there is atleast one value in the vector.

·Write a function voidselsort(vector & strs) to use selection sort tosort the vector of strings. It is a worthwhile experiment to tryleaving out the & and seeing that the vector stays exactly theway it is, but remember to put it back in before submitting.

·You need to use the above functionhere

·Once you know the elements you wantto swap, call the library swap(T& a, T& b) function to dothe swap, which after the 2011 standard, has been moved from to the library (though I thinkIDE’s automatically include this, so you probably won’t need toexplicitly #include it). The &’s in the prototype of thefunction allow it to actually move your values, but you should notbe using &’s when calling the function

·Write main() to test your selectionsort. You just need to output the

·Try at least two calls, one where theelements are already in order and one where you need at least twoswaps to order the values. For the following run, the first callwas done with “lion”, “tiger”, while the 2^nd call wasdone with “lion”, “tiger”, “zebra”, “bear” (the first swap is of“lion” and “bear”, so the 2^nd iteration starts with“bear”, “tiger”, “zebra”, “lion” and “lion” needs to be swapped tothe second position)

Before: lion tiger

After: lion tiger

Before: lion tiger zebra bear

After: bear lion tiger zebra