Suppose you have 10 sorted linked lists, each of size N, and you want to combine them into a sorted array. Come up with the most efficient algorithm to do this. What is its runtime complexity?

A) (1)

B) (lg N)

C) (N)

D) (N lg(N))

E) (N^2)

F) (N^2 lg(N))