Uber:\nQ1) You are given an array of integers u can replace two adjacent number (x,y) by their lcm iff gcd(x,y)>1. Find the array left after applying this operation to the array such that u cannot apply it anymore\nN<=1e3 and ai<=1e8\nQ2)You are given an n sized array of integers and an integer k. Ai denotes the tickets required by the ith person . Each second you can provide 1 ticket to the person at the start of the array and then the person goes to the end of the array.If the person acquires the required number of tickets,he is removed from the array. Output the min time required to fulfil kth person\'s demand\nQ3) You are given a binary string consisting of 0s and 1s. You can create a bouquet of rose with 3 consecutive 0\'s and earn p coins or u can create a bouquet of rose and lilly with 1 and 0 but these must be consecutive ans earn q cois. Find max coins u\xA0can\xA0earn\nN<=1e5

Uber:\nQ1) You are given an array of integers u can replace two adjacent number (x,y) by their lcm iff gcd(x,y)>1. Find the array left after applying this opera