In the implementation of the counting sort algorithm to sort an array, which option is correct?A$)$ The number of comparisons is equal to the length of the arrayb$)$ It needs extra memory space which is equal to the size of the array itselfc$)$ The order of equal numbers in the sorted array does not change.d$)$ This method is slower than merge sort