8. Consider the Lucas numbers: In = Ln-1 + Ln-2, n > 1; L1 = 1; Lo = 2. a a). Write a recursive function to compute Ln using the above definition directly. Implement your solution and print Li*5, where 0 1; G1 = ( 2 ) - (4); 60-() = = GO = 0 2 With this formulation, design a recursive algorithm for Gn such that the algorithm will return both Ln and Ln-1 with input parameter n. Hint 2: Can you use a primitive type to store L500? For programs in 8 a) and 8 b) of this question, you are NOT allowed to use Python. For C++ and Java, you can only use primitive types such as char, int, long and long long. You are not allowed to use large integer, such as BigInteger in Java, from the language library. You have to write your own large integer data type or object, if needed