Suppose that you're given a 3 by 3 table of pos. integers. For any step, you are either able to double each of the #s in any 1 row (horizontal), or you are able to subtract 1 from each of the #s in any 1 column (vertical). Come up with an algorithm that transforms the orig. table into a table of all 0's.

Note: need this explained in words how it works (not any pseudocode or programming), and showing an example of how this works.