Give a recursive algorithm which takes as input a sequence of numbers and returns the minimum (i. e., smallest) number in the sequence. Your algorithm should not use a loop.

Step-by-step explanation:

So let a[i] be the input array to the function find_minimum(): . We will use python to present this recursive algorithm

def find_minimum(a, n):

    if n == 1:

         return a[0]

    return min(a[n], find_minimum(a, n - 1))

find_minimum(a, len(a) - 1)

options a,b,c are the right answer.

step-by-step explanation:

a linear parent function is always represented as y = x

if we write this function in the form of y=mx+c

⇒

or  

now if we plot a graph we will find these characteristics:

1) y intercept of the graph is zero so its a straight line passing through origin.

2) as we can see in both the forms of function written, values of x and y may be either positive or negative for the positive slope means points on the graph are either in first quadrant or in third one.

3) it's slope is one.