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)