What is the Big O notation of the runtime of the following code? Please write in the format as O( ).fans) Assume "numbers" is an array that has at least 10 elements stored. SelectionSort(numbers) (...

Extracted text: What is the Big O notation of the runtime of the following code? Please write in the format as O( ).fans) Assume "numbers" is an array that has at least 10 elements stored. SelectionSort(numbers) ( int numbersSize = 10; for (1 0; i < numberssize;="" ++1)="" (="" indexsmallest="" i="" for="" (3="" i="" +="" 1;="">< numberssize;="" ++j)="" (="" if="" (numbers[j]="">< numbers[indexsmallest])="" (="" indexsmallest="" j="" numbers[i]="" temp="" numbers[1]="" numbers[indexsmallest]="" numbers[indexsmallest]="">