1) Describe what fork consistency is.

2) It turns out it is very hard to guarantee fetch-modify consistency
(sometimes called freshness) without some trust assumption. There are
even some impossibility results. Sketch a simple design for ensuring
 time-bounded fetch-modify consistency, namely, that the server did not fork
 two clients for more than some time bound B.  


3) What are the main techniques in SUNDR that achieve a smaller amount
of bandwidth and computation as compared to the expensive strawman file system?