Given an integer array nums and an integer target, return the number of times target appears in nums. You must implement the counting recursively without using any loops.
Input: An integer array nums and an integer target.
Output: Return an integer count.
Input: [1,2,3,2,1], 2
Output: 2
Explanation: 2 appears at indices 1 and 3 -> count = 2.Input: [7,7,7,7], 7
Output: 4
Explanation: All four positions match.Input: [1,2,3], 5
Output: 0
Explanation: 5 never appears.1 <= nums.length <= 10^4-10^9 <= nums[i] <= 10^9-10^9 <= target <= 10^9