Full Scheme differs from Scheme in the following ways (check all that apply; hint: 10): Full Scheme has call-with-current-continuation to access the interpreter's underlying continuation. Full Scheme has forget to remove a name from the environment. Full Scheme uses def ine to introduce all top-level bindings. Full Scheme has call-with-current-store to access the interpreter's underlying store. Full Scheme has free to remove a location from the store. Full Scheme uses the function assoc to operate on association lists. Full Scheme supports dictionaries, which can be written literally using the ! {k >v,,kv \} syntax. Full Scheme has a hygienic macro system. Full Scheme has delay and force for lazy computations. Full Scheme supports mutable vectors (arrays), which can be written literally using the () syntax. Full Scheme has set-env! to mutate the environment of a closure. Full Scheme was defined by an initial "Report on Scheme" that has never been revised. Full Scheme has mkc instead of cons. Full Scheme has a quasiquotation mechanism, which can splice computed values or lists into quoted S-expressions. Full Scheme allows functions that can take a variable number of arguments. Full Scheme implementations are required to use realtime, concurrent, and parallel garbage collection. Full Scheme supports three-valued logic, which can be written literally using the t (true), ? (unknown), and (false) syntax. Full Scheme implementations are required to be properly tail-recursive. Full Scheme uses the functions lookup and update to operate on association lists. Full Scheme has set-car! and set-cdr! to mutate the contents of a pair