Cons lst = append(x, y);and that

**
What is the Big O of this statement?
**

**Answer: A**

` append` makes a copy of the first input list, and reuses the
second input list. Therefore, its Big O depends only on the size of the
first input. The Big O is *O(n)* because the first input list is
copied, one element at a time.