Write a recursive function named largestDigit that accepts an integer parameter and returns the largest digit value that appears in that integer. Your function should work for both positive and...

Extracted text: Write a recursive function named largestDigit that accepts an integer parameter and returns the largest digit value that appears in that integer. Your function should work for both positive and negative numbers. If a number contains only a single digit, that digit's value is by definition the largest. You must not use any loops; you also cannot use the string type or any library functions. Your function must be recursive. Complete the following file: largestDigit.cpp 2 // You may use this helper function 3 int max(int a, int b) { return a < b="" b="" :="" a;="" }="" 4="" 5="" int="" largestdigit(int="" n)=""><0) &&="" (n/10=""><0) n="0))" return="" n;="" 8="" -n;="" static="" int="" maxi="" 9="" n%10;="" 0)="" return="" maxi;="" maxi="max(maxi," n%10);="" return="" largestdigit(n/10);="10" if((n/10)="" 11="" 12="" 13="" 14="" 15="" 16="" }="" submit="" calling="" with="" arguments="" name="" arguments="" actual="" expected="" pass="" largestdigit="" 135725="" 7="" 7="" pass="" largestdigit="" 111211="" 2="" 2="" fail="" largestdigit="" 100000="" 1="" pass="" largestdigit="" 4530021="" 5="" pass="" largestdigit="" 7639852="" fail="" largestdigit="" 76352="" 6="" pass="" largestdigit="" 666555444="" 6="" 6="" pass="" largestdigit="" 12424224="" 4="" pass="" largestdigit="" 1242526="" 6="" pass="" largestdigit="" o="">