The owner of HackerMall loves organized items. A row of items is organized with the party. Even or odd is different for each adjacent stack of items. To organize the row, half the items in the stack can be removed. This can happen as many times and on as many stacks as required. Determine the minimum number of operations needed to organize a row. More formally, given an array items brackets of integer of length n, the array is organized if for each x less than n-1 items of x mod 2 not equals to items of x plus 1 mod 2. a mod b is the remainder of a divided by b. In one operation, the owner can choose an element and divide it by 2. That is, if one chooses index x, then do items x equals floor of items x divided by 2. The goal is to return the minimum number of operations that one needs to perform to organize the array. Complete the function getMinimumOperations in the editor below. getMinimumOperations has the following parameters. In items of n, a row of stacks of items. The minimum number of operations needed to organize the arr