Answer:
To find the largest number of ribbons that can be put into each bundle, we need to find the greatest common divisor (GCD) of the number of red ribbons (3) and the number of blue ribbons (4).
The GCD of 3 and 4 is 1. Therefore, the largest number of ribbons John can put in each bundle is 1.