5. Cereal Segments You are at the grocery store trying to determine which cereal to buy. There is a row of different cereal brands in front of you, represented as an n-element array. You would like to find a cereal that is not too pricey but also not the most inexpensive. To do this, you scan every subarray of size x, starting from index 0. Subarrays are to be contiguous blocks of elements in the inclusive range from index i to index), where j - 1 + 1 = x and 0 Sisj<.>