give me full line to line code with execution to understand it properly

In this chapter the only sorting algorithm we use is the selection sort. It involves finding the smallest element in the list, putting it in the lowest index, and then finding the second lowest and putting it in the second index, and this goes on until we reach the end of our array and it is sorted. You can do this using the following code: Assignment Portion - hand in once completed integers and then display the mamher of even mumbers and odd munber. Astane that the ingor endo with 0 . Here is the sample nat of the program. 7.16 (Einwtion fiev) Write a program that chtatco an artay of namberv from I to 100,1000000 in micending ender. Dineliry the etcotion time of inviking the 11naar Seareh method and the Dinary5earch method in lintibe 7.6 abd whe the folliwing sole menglate in obtain the esecution time: *Use System.currentTimeNanoO to track the time that it takes before using the algorithms