hi,
thanks for the question and I agree here with David.
In English, "either … or" is not always exclusive and depends on the context. In our case (as negation of ".. AND ..") it is inclusive, listing possibilities rather than forcing a single choice.
For the runtime: n = |S| + |Q|. Note that you have determined in (a) necessary and sufficient condition for S and Q so that the program terminates. Maybe this helps? One may ask (but this is only one of many ways), what is the runtime depending on one of |Q| resp |S| and then ask for which |S|, resp, |Q| get the runtime maximized. But this is only one of many ways.
thanks for the question and I agree here with David.
In English, "either … or" is not always exclusive and depends on the context. In our case (as negation of ".. AND ..") it is inclusive, listing possibilities rather than forcing a single choice.
For the runtime: n = |S| + |Q|. Note that you have determined in (a) necessary and sufficient condition for S and Q so that the program terminates. Maybe this helps? One may ask (but this is only one of many ways), what is the runtime depending on one of |Q| resp |S| and then ask for which |S|, resp, |Q| get the runtime maximized. But this is only one of many ways.