Which of the following recurrence relations represent the solution to the coin change problem where denominations include penny, nickel, and half dollar?
C(n) = min(C(n-1), C(n-5), C(n-50)) + 1
C(n) = C(n-1) + C(n-5) + C(n-50)
C(n) = max(C(n-1), C(n-5), C(n-50)) + 1
C(n) = max(C(n-1), C(n-5), C(n-50))