pts$)$ True or false Binary search works for all sorted list To find the minimum value in a MIN$-$heap, it only takes O $(1)$ steps: In general, selection sort is faster thas valid dataIn general, only part of an array holds valid data for a partially filled array