Problem Statement

Define two associative arrays, where one represents the following "base" data: And the other represents "update" data: Merge these into a new associative array that contains every key found in either of the source ones. Each key should map to the value in the second (update) table if that exists, or else to the value in the first (base) table. If possible, do this in a way that does not mutate the original two associative arrays. Obviously this should be done in a way that would work for any data, not just the specific data given here, but in this example the result should be:

Let's start with the solution:

(define a1 {
   'name    "Rocket Skates"
   'price   12.75
   'color   "yellow"
})

(define a2 {
   'price   15.25
   'color   "red"
   'year    1974 
})

(print "a1: " a1)
(print "a2: " a2)

(define (collide a b) b) ; will use new key value
(print "merged a1 a2: " (ff-union collide a1 a2))