A binary min-heap is stored in an array with the smallest value stored at index 0 . If there are 5 elements stored in this min-heap, what are possible indexes for the largest value? Assume that all values are unique, so there is only one largest value possible. (Pick all indexes that are possible locations. Remember that the smallest value is at index 0.) 1 2 3 4 it is not possible to know