Lower Bound Proof - Given n coins, with up to 2 fake coins, weighing either more or less than real ones, give an advesary argument to show that any determinictic algorithm must make atleast Omega(log(n) weighings. You can assume that real coins have weight of 1 unit.