A linear-time subset test for sorted lists of symbols
General Form: (subsetp-eq-linear lst1 lst2)
where the guard specifies that both arguments are true-lists of symbols, sorted by symbol<. This computes the same result as (subsetp-eq lst1 lst2) (challenge: prove this!), but unlike subsetp-eq, it does so in linear time.
