Define a procedure that takes two lists of symbols, equal in length, and determines the number of positions at which they contain different values in 0(n) [a single pass].
For instance, given the lists (a b c e f g) and (a b d e g h), the procedure should return 3.