1. The Zippel lemma gives that the min distance of the Total 
degree-d code is at least d|F|^{n-1}. Show that it is also at most
d|F|^{n-1}. [now, this is really simple, if you think about it
for a moment.]
 
2. Show that the minimum distance of multi-degree-(d,...,d) code is
   (q-d)^n.