The Bohm-Jacobini theorem states that any flowgraph can be replaced by one with the same functionality that only uses the sequence, if-then-else, while and assignment statements (i.e., prime program components). Show that you don't need the if-then-else. That is, sequence, while and assignment are sufficient. _____

Fill in the blank(s) with the appropriate word(s).

if p then S else T; can be replaced by:
notdoneflag := true;
while p and notdoneflag do
{S; notdoneflag:= false}
while not(p) and notdoneflag do
{T; notdoneflag:= false}