write the algorithm for what rachael needs to do

. On each of the avenues, there is a tower of beepers of an unknown height, although some avenues (such as 7th in the example photo) may be empty. e Rachel's job is to collect all beepers in each of these towers and put them back down on the easternmost corner of 1st street (bottom right of her world), then return to her starting position. Rachel does not have any beepers in her pouch when she starts. See next slide for an "after" photo. 4 Imagine that Rachel is now living in a world that looks something like this: 5 3 7 3 Rachel's World After Work is Complete 7 3 22 11 1 235 6789 5 What Rachel Knows How To Do move() - Takes 1 step forward turnLeft() Turns 90 degrees to the left putBeeper()- places 1 beeper at the spot Rachel is standing pickBeeper() picks up 1 beeper at the spot Rachel is standing Rachel also understands repetition (While and Repeat) What Rachel Knows How to Test Test Opposite What it Tests frontlsClear frontlsBlocked Is there a wall in front of Rachel? Is there a wall to Rachel's left? leftlsClear rightlsClear beepersPresent beepersInBag leftlsBlocked rightlsBlocked noBeepersPresent noBeepersinBag Is there a wall to Rachel's right? Are there beepers on this spot? Are there beepers left in Rachel's bag