Show that for any integer n that is a power of $2,$ there is an instance of the set cover problem with the following properties: $($i$)$ There are n elements in the base set. $($ii$)$ The optimal cover uses just two sets. $($iii$)$ The greedy algorithm picks at least log n sets.