Problem: Merge K Sorted Lists
Problem Description: Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

Use recursive approach, divide this problem to a set of merge two sorted linked lists problems. If each list has n elements and we have k lists, the complexity should be O( nk(log k ) );