You are given a positive integer consisting only of digits 6 and 9. Find the maximum value that can be achieved by turning AT MOST one-digit upside down. For example, given 696: Turning the first 6 makes 996 Turning the 2nd digit upside down makes 666 Turning the 3rd digit upside down makes 699 The function would return 996 as that is the maximum value among the 3 options Write a function: int solution(int A): That given an integer A, Returns the maximum integer that can be achieved (by turning upside down at most one digit in A) Assume that, A is an integer within the range [6 to 999,999,999] Integer A only contains digits 6 && 9