Write a Python Program. Do NOT use any variables. (Also, do NOT use any recursive procedure calls, that is, no functions call themselves.) Due Thursday 2/10/21.

TASK: Program Reeborg to run a steeplechase. In this race the hurdles are arbitrarily high and arbitrarily wide, and the course has no fixed finish corner. In each race course the finish is marked by a beeper that Reeborg must pick up before turning himself off. Reeborg starts at the origin facing East. Only the leftmost beeper along Street 1 is considered the finish mark; ignore any other beepers that may be present. The figure below illustrates one possible course; Reeborg completes this race once he reaches Avenue 16, which is where the leftmost beeper along Street 1 is located. 10 9 8 7 6 5 Street 2 1 (1) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Avenue TASK: Program Reeborg to run a steeplechase. In this race the hurdles are arbitrarily high and arbitrarily wide, and the course has no fixed finish corner. In each race course the finish is marked by a beeper that Reeborg must pick up before turning himself off. Reeborg starts at the origin facing East. Only the leftmost beeper along Street 1 is considered the finish mark; ignore any other beepers that may be present. The figure below illustrates one possible course; Reeborg completes this race once he reaches Avenue 16, which is where the leftmost beeper along Street 1 is located. 10 9 8 7 6 5 Street 2 1 (1) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Avenue