Write a program that tasks Karel to pick up a beeper on the current corner, moves to the next corner and picks up the next beeper and so on until Karel reaches a corner where no beeper is located.$$ At that point, Karel faces to the$$EAST$$and starts laying the beepers back out in a straight line, one beeper on each corner until he is out of beepers in his beeper bag. This one requires two separate loops, one to pick up the beepers and another one to lay them out.

The rules:

$1.$ Initially, Karel is facing$$NORTH$$on street $2,$ avenue $2$ with NO beepers in his beeper bag.

$2.$ Start searching for beepers on the corner Karel is initially placed on$.$ There may be $0$ or $1$ beeper on each corner $($thus Karel may not move at all, nor lay any beepers to the east if the first corner has no beepers on it$).$

$3.$ After Karel reaches the first corner without a beeper, the first loop terminates, Karel faces$$EAST$$and$$immediately$$starts placing beepers and places ONLY $1$ beeper on each corner as he moves to the East.$$ He continues to place beepers until there are no more beepers in his bag.

$4.$ No "error$-$shutoffs."