Find the count of subsequences where each element is divisible by K
Given an array arr[] and an integer K, the task is to find the total number of subsequences from the array where each element is divisible by K.Examples: Input: arr[] = {1, 2, 3, 6}, K = 3 Output: 3 {3}, {6} and {3, 6} are the only valid subsequences.Input: arr[] = {5, 10, 15, 20, 25}, K = 5 Output: