CSCI 201 -- Introduction to Algorithm Design -- handout 2 Problem 1 Due September 17 Assume Karel is placed in a following rather simple (and uninteresting) World. There are no walls except the West and South boundary walls. Karel is located on 1st Street and 1st Avenue At one and only one of the intersections with 1st Street let's say the intersection of 1st Street and Mth Avenue, there are N beepers. Karel's task is to move these N beepers from the intersection of 1st and Mth to the intersection of 1st and Nth and then turn itself off. You are to write a program to accomplish Karel's task AND you must then give a convincing argument that Karel also completes the assigned task correctly. It is not necessary to run your program and the fact that your program has successfully executed will not be considered conclusive evidence (by the instructor) that your program is correct. I'm interested in your argument! That's what counts.