This question hasn't been answered yet ask an expert there are n bulbs numbered from 1 to n, arranged in a row. the first bulb is plugged into the power socket and each successive bulb is connected to the previous one. (second bulb to first, third to second) initially, all the bulbs are turned off. a moment k (for k from 0 to n-1), the a[k]-th bulb is turned on. a bulbs shines if it is one and all the previous bulbs are turned on too. write a function in java that given an array a of n different integers from 1 to n, returns the number of moments for which every turned on bulb shines.