Java problem:

I want to write a recursion program that determines the number of occurrences for each distinct element in the list. For example,

[0, 0, 0, 0, 1, 1, 1, 2, 2, 3, 4, 4, 5, 6, 6, 6, 6] which gives {0=4, 1=3, 2=2, 3=1, 4=2, 5=1, 6=4}. And what is the recurrence formula for T(N)

, is that will be T(N) = 2T(n/2) + n