LABEL each DEGREE first. Then, calculate the OPTIMAL eulerization for each graph. Finally, find the ACTUAL
eulerization needed for each graph. ACTUALLY DRAW the duplicate edges needed in a different color.

LABEL each DEGREE first Then calculate the OPTIMAL eulerization for each graph Finally find the ACTUAL eulerization needed for each graph ACTUALLY DRAW the dupl class=