Brute Force Solution
IntuitionTo find how many elements in each array are also present in the other, we can look for intersections and count how many times each intersecting element
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
To find how many elements in each array are also present in the other, we can look for intersections and count how many times each intersecting element appears in both arrays.

# Approach
<!-- Describe your approach to solving the problem. -->
1. Iterate over all pairs of elements from `nums1` and `nums2` to find common elements.
2. Store the intersecting elements in a list, then convert it to a set to remove duplicates.
3. Count the number of occurrences of these intersecting elements in both `nums1` and `nums2`.
4. Return a tuple with the counts.



# Code
```python3 []
from typing import List

class Solution:
    def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:
        a = []

        for i in range(len(nums1)):
            for j in range(len(nums2)):
                if nums1[i] == nums2[j]:
                    a.append(nums1[i])

        a = list(set(a))  

        count1 = 0
        for num in a:
            for i in range(len(nums1)):
                if num == nums1[i]:
                    count1 += 1

        count2 = 0
        for num in a:
            for i in range(len(nums2)):
                if num == nums2[i]:
                    count2 += 1

        return (count1, count2)
```

['Python3']