You are required to fix all the logical error in the given code. You can click on Run anytime to check the compilation/execution status of the program. You debug your code. The submitted code should be logically/syntactically correc all testcases. Do not write the main() function as it is not required. Code Approach: For this question, you will need to complete the code as in implementation. We do not expect you to modify the approach. The function/method count TripletSumPermutations accepts three arguments: size, an integer representing the size of the list; arr, representing the list of integers; tripletSum, an integer representing the value to compare. The function/rethod returns an integer representing the number of triplets from th product is equal to the given tripletSum. The code compiles successfully but fails to return the desired result for some test ca incorrect implementation of the function/method count TripletSumPermutations. the code so that it passes all the test cases. mpile and Run IHOIDI 1 int (int size , int* arr, int tripletSum) 2-1 3 int count 4 for(int i 0; i < size 2; i++) 5 { 6 if (tripletSum % arr[i] 7- { 8 for (int j =0; j < size 1; j++) { 10 if (tripletSum % Carr[i] * arr[j]) = %) 11 - { 12 int value = tripletSum /(arr[i] * arr[j]); 13 for(int k = j + 1 ; k < size ; k++) 14 if (arr[k] == value) 15 count++; 16 17 18 } 19 } 20 return count; 21 }