Step 1 :The problem is asking for the greatest common divisor (GCD) of the number of California Sushi Rolls and Spicy Tuna Sushi Rolls. The GCD is the largest number that divides both numbers without leaving a remainder. This is because each plate must have the same number of each type of sushi roll, and we want to use all the sushi rolls.
Step 2 :Let's denote the number of California Sushi Rolls as \(a = 72\) and the number of Spicy Tuna Sushi Rolls as \(b = 60\).
Step 3 :We need to find the greatest common divisor (GCD) of \(a\) and \(b\).
Step 4 :The greatest common divisor (GCD) of \(a\) and \(b\) is 12.
Step 5 :So, the greatest number of plates Melody can make using all of the sushi rolls is \(\boxed{12}\).