Rahul is an electrician. He is having a 2-D tray where each box of tray contains working or fused light bulb or may be empty. Every minute, any working bulb that is 4-directionally adjacent to a fused bulb becomes fused. Return the minimum number of minutes that must elapse until no box in tray has a working bulb. If this is impossible, return -1.

Example- Tray = [[1,2,1],[1,2,0],[0,2,1]] Output = 1 Description = 0 representing empty box, 1 representing working light bulb, 2 representing fused light bulb

It is a DSA problem

pls ans quickly