You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list. You may assume the two

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself. Example 1: Input:$11=[2,4,3], 12=[5,6,4]$\nOutput: [7,0,8]\nExplanation: $342+465=807$.\nExample 2:\nInput: l1 = [0], l2 = [0]\nOutput: [0]\nExample 3:\nInput: $11=[9,9,9,9,9,9,9], 12=[9,9,9,9]$\nOutput: $[8,9,9,9,0,0,0,1]$ \nConstraints:

• The number of nodes in each linked list is in the range [1, 100].
• $0<=$ Node.val $<=9$- It is guaranteed that the list represents a number that does not have leading zeros.