Write a function that checks if two sorted linked lists contain a common value and briefly explain its time complexity. Write the function such that its time complexity is as low as possible. Python def CommonValueSorted(root1, root2): # root1 and root2 are ListNode objects that reference roots of two different lists # Both lists are already in nondecreasing order # Function should return True if the two lists include a ListNode with the same value. # CODE REQUIRED