1. Show that this modified Lempel-Ziv code is still not ‘complete', that is, there are binary strings that are not encodings of any string.
2. Give examples of simple sources that have low entropy but would not be compressed well by the Lempel-Ziv algorithm.