In the diagram formed of twenty O’s below, in how many ways may four be selected such that they form a square?
What is the least number of O’s that may be removed such that none of these squares remains intact?