... NULL */else if (L->element == M->element)return assemble(L->element, L->next, M->next);else if (L->element < M->element)return assemble(L->element, L->next, M);else ... cell.46•• 31 942LM INTRODUCTION TO COMPUTER SCIENCE HANDOUT #2. SET THEORYK5 & K6, Computer Science Department, Vaên Lang UniversitySecond semester Feb, 2002Instructor: Traàn Ñöùc ... assemble(L->element, L->next, M);else /* here, M->element < L->element */return assemble(M->element, L, M->next);}2 .3 IMPLEMENTATION OF SETS 13 • S is properly contained in T• T properly...