def solution(p): answer = chk(p) return answer def chk(p): if p=="": return "" else: u,v=devide(p) if chk_right(u): return u+chk(v) else: u_inverse="" for i in u: if i =="(": u_inverse+=")" elif i ==")": u_inverse+="(" return "("+chk(v)+")"+u_inverse[1:-1] def chk_right(p):# check p is right l_num=0 r_num=0 for ch in p: if ch=='(': l_num+=1 elif ch==')': r_num+=1 if r_num>l_num: right=0 break el..