you are given a complex list of n products, each with name, price, and weight.find out how many duplicate products are within the list.Duplicate products contian identical parameters for all fields in the list$($i$.$e name, price and weight$).$ complete the function numDuplicates. The function must return an integer denoting the number of duplicates with in the product list. numDuplicates has the following parameter$($s$)$: String name$[$n$]$: srting array size n$,$ where names$[$i$]$ denotes the name of the product at the index of i$.$ int price$[$n$]$: int array of size n$,$ where prices$[$i$]$ denotes the price of the product at the index i$.$ int weight$[$n$]$: int array of size n$,$ where weights$[$i$]$ denotes the weight of the product at the index of i$.$