Fill in the details for Planning for ZigZagLakes

1. High Level algorithm
   • The first Jeroo should follow the trail of flowers around the lakes, going from the northwest to the southeast, picking each flower it finds along the way. It should stop after all flowers have been picked and pass them to the second Jeroo. The second Jeroo should then follow the trail of nets from the southeast to the northwest. This Jeroo will disable each net as it comes to it by tossing a flower on it, stopping at the shore. At the end of the program, the first Jeroo and second Jeroo should each do a spin (360-degree turn) to celebrate what they have accomplished.
2. Break the large parts into more detailed parts
   

   	pickFlowers	giveFlowers	disableNets	dance
   pseudo code	while there is a flower nearby, pick a row and decide what way to turn	Find the other Jeroo as long as the jeroo has flowers give them away	1st find the nets, then keep doing this: disable a row decide which way to turn or if you should hop ahead	Turn 4 times
   code	method pickAll(){ while(________________________) { pickARow(); decide();} }	method giveAll(){ find(); while(________________) }	method netAll(){ findNets(); while(_________________________){ disableRow(); decide2(); } }	method spin(){
   break down the parts	method pickARow(){ } method decide(){ }	method find(){ }	method findNets(){ } method disableRow(){ } method decide2(){ }