you give num array positive integer size 2 n you perform n operation arrayIn ith operation 1indexed willchoose element x yreceive score gcdx yRemove x y numsReturn maximum score receive perform n operationsthe function gcdx y great common divisor x y Example 1input num 12output 1explanation the optimal choice operation is1 gcd1 2 1example 2input num 3468output 11explanation the optimal choice operation is1 gcd3 6 2 gcd4 8 3 8 11example 3input num 123456output 14explanation the optimal choice operation is1 gcd1 5 2 gcd2 4 3 gcd3 6 1 4 9 14 constraints1 n 7numslength 2 n1 numsi 106