public static int former(int i){
    if (i <= n){
        int o = former(i+1);
        int v= cc + o;
        for(int k = i+1 ;k <= n; k++){
            if (k == n){
                v=  Math.min(v,cc+g[i][k]);
            } else {
                v=  Math.min(v,c+g[i][k]+former(k+1));
            }
        }
        return v;
    }
    return 0;
}