Indicate the input size for an algorithm that solves:

I, algorithm's complexity is measured on input size instead o input values. Please indicate the input size for an algorithm that solves the following problem Given: a number n and two primes p, q, Question: is it the case that n-p q? In Lesson 2, we learned linear-time selection algorithm where the input array of numbers are cut into groups of size 5. Show that, when the group size is 7, the algorithm still runs in linear time. I, algorithm's complexity is measured on input size instead o input values. Please indicate the input size for an algorithm that solves the following problem Given: a number n and two primes p, q, Question: is it the case that n-p q? In Lesson 2, we learned linear-time selection algorithm where the input array of numbers are cut into groups of size 5. Show that, when the group size is 7, the algorithm still runs in linear time