What is the Average case time efficiency of the Selection Sort using brute force technique $?$a$.$ O$($n$2),$ It occurs when the array is already sorted. $($where n is the number of integers in an array$)$ b$.$O$($n$2),$ It case arises when the elements of the array are in a disordered or random order, without a clear ascending or descending pattern. c$.$O$($n$2),$ It scenario arises when we need to sort an array in ascending order, but the array is initially in descending order. d$.$All mentioned