// DRUNKWATER TEMPLATE(add description and prototypes)
// Question Title and Description on leetcode.com
// Function Declaration and Function Prototypes on leetcode.com
//21. Merge Two Sorted Lists
//Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
//Example:
//Input: 1->2->4, 1->3->4
//Output: 1->1->2->3->4->4
///**
// * Definition for singly-linked list.
// * public class ListNode {
// *     public var val: Int
// *     public var next: ListNode?
// *     public init(_ val: Int) {
// *         self.val = val
// *         self.next = nil
// *     }
// * }
// */
//class Solution {
//    func mergeTwoLists(_ l1: ListNode?, _ l2: ListNode?) -> ListNode? {
//    }
//}



// Time Is Money