You are given an array of numbers and you have to return the count of subarrays whose elements and operations gives 0\n\nEx:\nInput: ```arr = [8, 9, 1, 2]```\noutput: ```4```\nExplanations:\nThe subarrays which satisfy the consition are:\n[8, 9, 1, 2], (8 & 9 & 1 & 2 = 0)\n[8, 9, 1], (8 & 9 & 1 = 0)\n[9, 1, 2], (9 & 1 & 2 = 0)\n[1, 2] (1 & 2 = 0)\nso return 4\n\nI can think of O(n^2) solution \nlink to leetcode playground: https://leetcode.com/playground/fnVa5ttH\n\nIs it possible to get a recursive solution with better complexity?

You are given an array of numbers and you have to return the count of subarrays whose elements and operations gives 0\n\nEx:\nInput: arr = [8, 9, 1, 2]\noutput: