solve pls fast in c++ or java or python Given an array \( a \prod \) of \( n \) integers, find an array \( b[ \) of \( n \) integers where \( b[i] \) is the minimum value that occurs at least once in all subarrays with size \( i+1(0 \leq i 1 answer