True or false:

a. all algorithms can be stated recursively.

b. some algorithms can only be stated recursively.

c. for most people, recursive algorithms are more difficult to discover and understand than nonrecursive algorithms.

d. all recursive algorithms must have an escape clause

3< x< 5

step-by-step explanation:

|x - 4| < 1

there are two solutions, one positive and one negative.   remember to flip the inequality when taking the negative solution

x-4 < 1       x-4 > -1

add 4 to each side

x-4+4 < 1+4       x-4+4 > -1+4

x< 5                 x> 3

3< x< 5

the answer is b.

step-by-step explanation:

by the trigonometric ratio tangent, tangent equals opposite divided by adjacent.

therefore, tan(50) equals ac/3

multiply each side by 3 to get: ac=3tan(50)

the answer is b.

the answer is b. 60. each interior angle in 120, so the exterior angle must be 60 in order to add up to 180

step-by-step explanation: