For a sequence of numbers, suppose that you attach 1, then 2, then 3, and so on up to n. What is the big-O time analysis for the combined time of attaching all n numbers? How does the analysis change if you insert n first, then n-1, and so on down to 1-always using insert instead of attach