Suppose we modify the deterministic linear-time selection algorithm by grouping the elements into groups of 7, rather than groups of 5. (use the "median-of-medians" as the pivot, as before.) does the algorithm still run in time? what if we use groups of 3?

Given: ab ≅ cd and ad ≅ bc prove: abcd is a parallelogram. statements reasons 1. ab ≅ cd; ad ≅ bc 1. given 2. ac ≅ ac 2. reflexive property 3. △adc ≅ △cba 3. ? 4. ∠dac ≅ ∠bca; ∠acd ≅ ∠cab 4. cpctc 5. ∠dac and ∠bca are alt. int. ∠s; ∠acd and ∠cab are alt. int. ∠s 5. definition of alternate interior angles 6. ab ∥ cd; ad ∥ bc 6. converse of the alternate interior angles theorem 7. abcd is a parallelogram 7. definition of parallelogram what is the missing reason in step 3? triangle angle sum theorem sas congruency theorem sss congruency theorem cpctc