A subarray is considered compromised if the bitwise OR of all elements in any subarray is present in the subarray itself. Find the number of compromised subarrays in a given array of positive integers.
A subarray is defined as any contiguous segment of the array.
Example arr = [2, 4, 7] Answer = 5
Please help with the processing idea?



