Preliminaries

The cs$1$robots library used in Lab $1-3$ is used. Specifically, you may need to use the

following methods:

drop$\_$beeper$()$

pick$\_$beeper$()$

on$\_$beeper$()$

carries$\_$beeper$()$

move$()$

turn$\_$left$()$

load$\_$world$()$

front$\_$is$\_$clear$()$

left$\_$is$\_$clear$()$

right$\_$is$\_$clear$()$

Requirements

$($Task $1.10$ points$)$ Implement a function goUntilRunOut$()$

In the Task $1,$ a straight$-$shaped world is given. The length of streets is $1$ and the

length of avenues is an unknown number from $1$ to $100.$ Write a function

goUntilRunOut$()$ that makes Hubo move until the fuel runs out. The number of

beepers Hubo starts with is a random integer greater than or equal to $0.$ When

Hubo can$$t move any further, Hubo must drop all beepers on the spot.

Note: Hubo named hubo is already created at $(1,1),$ heading East. You must not

create a robot again!

Note: You must use hubo to move Hubo.

Note: There are example code lines to help you. You may start the task by

erasing them first.

Note: You can write any additional functions you would like.

Note: Hubo should be at the precise position as the result of moves. Also the

numbers of beepers laid over the world must be accurate. The direction of the

Hubo is not checked