hi can anyone answer this question for me?

Say we have to sort an array of size 10000 that is holding integers where each integer is of 32-bit size (i.e., the max value of integer is about (2^32 – 1)). Which algorithm, merge sort or counting sort, will be cheaper in terms of time complexity? Give precise explanation.