Count of divisors of product of an Array in range L to R for Q queries
Given an array arr of size N and Q queries of the form [L, R], the task is to find the number of divisors of the product of this array in the given range.Note: The ranges are 1-positioned.Constraints: 1<= N, Q <= 105, 1<= arr[i] <= 106. Examples: Input: arr[] = {4, 1, 9, 12, 5, 3}, Q = {{1, 3}, {3, 5}} Output: 9 24 Input: arr[] = {5, 2,