Given an infinite supply of the regular hexagons whose sides have lengths of either 1 unit or 2 units, is it possible to tile plane so as to employ at least one hexagon of each size. (When the plane is tlled, every point should either be underneath exactly one hexagonal tile or on the boundary between tiles).