Quality Bike Maps has produced four map designs for the local area. A limited amount of time (in minutes) is allocated to the printing, cutting and folding of each map. Additionally, at least one thousand of map designs A, B, and C must be printed. The profit per map is $1 for A and B and $2 for C and D. Using the Report below, which constraints are NOT binding? Variable Cells Cell SBS18 $C$18 SD$18 SE$18 Name Map A Map B Map C Map D Final Value 1500 1000 1000 2833.33 Reduced Objective Allowable Cost Coefficient Increase 1 1 1 0.33333 2 0.33333 Olofoto Allowable Decrease 0.3333 1E+30 1E+30 0.5 Constraints Cell Name $B$24 Print $B$25 Cut $B$26 Fold $B$27: PrintA $B$28 PrintB $B$29: Print Final Shadow Constraint Allowable Allowable Value PriceR .H. Side Increase Decrease 150000 . 5 15000 1000 5666.6667 16500 20000 1 E+30 3500 200000.16667200007000 1000 1500 0 1000 5001E+30 1000 0.33333 1000 1750 1000 1000 -0.33333 1000 500 1000 Print, Fold, Print B and Print C Print B and Print Print and Cut Print and Fold Cut and Print A