For this Question: Given an Integer n, convert that integer to linked list such that every node contains single digit as character and return the head node.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>makeList()</b> that takes Integer n as parameter.

<b>Constraints:</b>
1 &le; n &le; 100000000Return the head of linked list.Sample Input:
273
Sample Output:
2 7 3
Sample Explanation:
here head of list contains 2,
second node contains 7 and,
third node contains 3., I have written this Solution Code: /*
    class Node {
        Node next;
        char val;

        Node(char val) {
            this.val = val;
            next = null;
        }
    }
*/


    public static Node makeList(int n) {
    Node head = null;
    while (n > 0) {
        char digit = (char) (n % 10 + '0');
        Node newNode = new Node(digit);
        newNode.next = head;
        head = newNode;
        n /= 10;
    }
    return head;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not?