Special PairYou are given an array A of length N A$[$i$]$ specifies the chocolate taste score. Two friends, Emma and Lily, want to eat special chocolate You must count the different types of special pairs of chocolate taken by them. A special pair $($C$,$ Cj$)$ is defined as CiCjj, where $//$ are the indices of the array A and C$,$ C$,$ are the corresponding taste scores.Print the count of all possible combinations of the special pairs.NoteN is always greater than $2\mathrm{.}1-$based indexing is used.Function DescriptionIn the provided code snippet, implement the provided specialPair$(...)$ method to print the count of all possible chocolate combinations of the special pairs. You can write your code in the space below the phrase "WRITE YOUR LOGIC HERE"