In the context of the COMP2001 Framework and other frameworks which we will use later in the module, it is common to formulate optimisation problems as minimisation problems where the goal is to minimise some cost or penalty as defined by the objective function. 

Within the COMP2001 framework we will be using a minimisation objective function for the MAX-SAT problem where the aim is to minimise the total number of unsatisfied clauses.

What would be the objective value of a solution to the problem instance (A∨¬B)∧(B∨C)∧(¬A∨¬C) with the representation “110” if we were using the minimisation objective function?