The correct choice is (c) O(n^2)
Best explanation: The auxiliary space complexity of bead sort is O(n^2). It is because an array of size maximum_element*n (maximum_element is the maximum element that is present in the array and n is the size of the array) has to be maintained.