code: function solveConstantEquation(equation, debug, steps=[]) {
    const compareFunction = COMPARATOR_TO_FUNCTION[equation.comparator];
  
    if (!compareFunction) {
      throw Error('Unexpected comparator');
    }
  
    steps = addSimplificationSteps(steps, equation, true, debug);
    if (steps.length > 0) {
      const lastStep = steps[steps.length - 1];
      equation = Equation.createEquationFromString(
        lastStep.newEquation.print(), equation.comparator);
    }
  
    // If the left or right side didn't have any steps, unnecessary parens
    // might not have been removed, so do that now.
    equation.leftNode = removeUnnecessaryParens(equation.leftNode);
    equation.rightNode = removeUnnecessaryParens(equation.rightNode);
  
    if (!Node.Type.isConstantOrConstantFraction(equation.leftNode, true) ||
        !Node.Type.isConstantOrConstantFraction(equation.rightNode, true)) {
      throw Error('Expected both nodes to be constants, instead got: ' +
                  equation.print());
    }
  
    const leftValue = equation.leftNode.eval();
    const rightValue = equation.rightNode.eval();
    let changeType;
    if (compareFunction(leftValue, rightValue)) {
      changeType = ChangeTypes.STATEMENT_IS_TRUE;
    }
    else {
      changeType = ChangeTypes.STATEMENT_IS_FALSE;
    }
  
    // there's no oldEquation or change groups because nothing actually changes
    // here, it's just a final step that states the solution
    const equationStatus = new EquationStatus(changeType, null, equation);
    if (debug) {
      logSteps(equationStatus);
    }
    steps.push(equationStatus);
    return steps;
  }
docs: Given an equation of constants, will simplify both sides, returning the steps and the result of the equation e.g. 'True' or 'False'