Problem Statement

A deep-space observatory has lined up N telescopes in a row, and each one needs a different amount of calibration time. Ahead of an upcoming cosmic event, Q engineers are sent out to get every telescope calibrated as fast as possible. Each engineer is handed one contiguous stretch of telescopes to work on, and every telescope must belong to exactly one engineer's stretch. Define an engineer's fatigue as the number of telescopes in their stretch multiplied by the largest calibration time among those telescopes. Since an overworked engineer is more likely to make mistakes, the observatory wants to choose the stretches so that the worst (largest) fatigue experienced by any one engineer is as small as possible. Find that optimal assignment of telescopes to engineers. Function Description Implement the function telescopeCalibration , which splits the N telescopes into Q contiguous blocks and returns the smallest possible value of the largest fatigue among the blocks. Parameters: N (int): To