Sheldon has n friends each of them has some money, given in an array. How many ways he can choose three friends so that his group have k rupees. Given Sheldon does not have any money. Example: Input: A]=[2,7,4,0,9,5,1,3],k=6 Output: 3 Explanation: The triplets with a sum equal to array. import java.util.*; class Main \{ 1/ Function to print the number of triplets in an array with the given sum k public static int printAllTriplets(int[] arr, int k)\{ \} public static void main(String[] args)\{ Scanner sc = new Scanner(System.in); int n=scnextInt(); int k=sc.nnextInt(); int arr[]= new int[n]; for(int i=0;i<>