Merge k sorted linked list and return it as one sorted list.Analyze and describe its complexity. Write in java

Practice 1 Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. ** * Definition for singly-linked list. * public class ListNode { * int val; ListNode next; ListNode(int data) { val = data; } } * * * class Solution { public ListNode mergeKLists(ListNode[] lists) { }