In a computer program, statements often are written as goto statements. these tell the computer to go to a particular line in the program if certain conditions are met. given any two numbers, the program shown below puts the numbers in order according to size.
10 input x
20 input y
30 if x > y then goto 60
40 if x < y then goto 70
50 if x = y then goto 80
60 print y, x: end
70 print x, y: end
80 print x = y: end
refer to the above program and use the chart below to work through questions 1 and 2 that follow.
hypothesis (p) t or f negation (~p) t or f
1. for each conditional statement in the program, write the p clause (hypothesis) in the first column of the chart. then write the negation (~p) in the third column of the chart. (12 points)

sine

step-by-step explanation:

step-by-step explanation:

part a. the differences are decreasing, so we know the sequence is not arithmetic. the ratios are constant (=3/4), so we know the sequence is geometric.

part b. from part a, we know the common ratio is 3/4, so each term is 3/4 of the one before. the initial term is the number of gallons at h=1.

g[h] = (3/4)·g[h-1]

g[1] = 384 . . . . initial value required for a recursive definition

part c. the general formula for a geometric sequence is

a[n] = a[1]·r^(n-1)

we have a[1] = 384, r = 3/4, and the term number given by h. the formula that follows is

g[h] = 384·(3/4)^(h-1)

part d. filling in the value and doing the arithmetic, we have

g[12] = 384·(3/4)^11 ≈ 384·0.042235136 ≈ 16.2183 . . gallons

part e. each gallon is 4 quarts, so

16.2183 gal × 4 qt/gal = 64.8732 qt