Consider the following algorithm for MaxCut problem: Given a given graph G=(V,E). Assume that in the beginning all nodes are unassigned, i.e. sets A,B are empty. While there still are unassigned nodes remaining Pick unassigned nod Assign a node either to the set A or to the set B with equal probability 1/2. Output cut (A,B). What is the expected approximation ratio of this algorithm?