;;Programming Project #3

;;Question 1
(setf s1 '(a b c d))
(setf s2 '(c d e f))

(myunion s1 s2)
;Result: (A B C D E F) in any order

(myintersection s1 s2)
;Result: (C D) in any order

(set_difference s1 s2)
;Result: (A B) in any order

;;Question 2
(setf li1 '(1 2 3 8 10))

(mymerge 5 li1)
;Result: (1 2 3 5 8 10)

;;Question 3
(setf li2 '(0 1 4 5 9))

(ounion li1 li2)
;Result: (0 1 2 3 4 5 8 9 10)

(ointersection li1 li2)
;Result: (1)

(oset_difference li1 li2)
;Result: (2 3 8 10)

;;Question 4
(setf li3 '(10 5 20 3 1 2 11 18))

(mysort li3)
;Result: (1 2 3 5 10 11 18 20)

;;Questions 5-9
(setf expr1 '( ( ( ( a . b ) . c ) . d ) . ( ( ( a . b ) . f ) . e ) ) )

(occur 'a expr1)
;Result: T

(num_occur 'a expr1)
;Result: 2

(nodups expr1)
;Result: (A B C D F E) in any order

(multiplicity expr1)
;Result: ((A.2) (B.2)) in any order

(multi_occur_sexpr expr1 '( a . b ))
;Result: T