3. Given an integer n, write a program that output the maximum digit found in n. Command Line Input: [user@reduxl user)./a.out 39562 Sample Output: Maximum digit: 9 4. Given the following adjacency matrix a tree or not. Explain your answer in detail. ng adjacency matrix for a connected graph, G. Determine if G is 0 0 0 0 Adjacency Matrix for the connected graph G: 1 0 0 0 0 0 0 1 0 0 0 0 1 0 1 1 1 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 3. Given an integer n, write a program that output the maximum digit found in n. Command Line Input: [user@reduxl user)./a.out 39562 Sample Output: Maximum digit: 9 4. Given the following adjacency matrix a tree or not. Explain your answer in detail. ng adjacency matrix for a connected graph, G. Determine if G is 0 0 0 0 Adjacency Matrix for the connected graph G: 1 0 0 0 0 0 0 1 0 0 0 0 1 0 1 1 1 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0