Problem: Frequency Counting with a TwistGiven an array of integers, write a function to count the frequency of each element in the array. However, add a twist to the problem:If the frequency of an element is equal to the element itself, double its frequency. If the frequency is greater than the element itself, triple its frequency.Write a function or method to solve this problem efficiently.Example:Input: $[2,3,2,3,4,4,4,5,5,5,6]$Output: $\{\text{'}2\text{'}$: $4,\text{'}3\text{'}$: $6,\text{'}4\text{'}$: $12,\text{'}5\text{'}$: $15,\text{'}6\text{'}$: $18\}$