please show work

Consider the following function:

01: void cpVL (const list& source, int N, vector& dest) 02: { 03: auto k = source.begin(); 04: for (int i = 0; i < source.size(); ++i) 05: { 06: auto it = lower_bound(dest.begin(), dest.end(), *k); 07: if (it == dest.end() || *it != *k) 08: dest.insert(it, *k); 09: ++k; 10: } 11: } 

and the following list of complexity values:

A: O(1), B: O(log N), C: O(N), D: O(N log N), E: O(N²), F: O(N³), G: O(N⁴)

where N denotes the value of source.size().

For each of the ranges of line numbers below, enter the letter code (A-G) of the closest correct complexity for that range of lines or X if none of the options is correct.

Assume that dest is empty when the function is called.

Line 3: Line 6: Line 8: Line 7: Lines 7-8: Lines 6-9: Lines 3-10