'Let positive integer n be given. Of the following randomized algorithm, what is the expected value of the final value of t? Show your steps and/or justification. p:= 0 t:= 0 while p < n do: t:=t+1 if random(1, 1 + 2") # 1 then: p:= p+1

Do you have any recommendations for methods to capture the data flow?

I would want to turn in a PowerPoint presentation so that the APA citations and references may be reviewed by another person before being presented to the lecturer for consideration.