please provide python code for this

2 Paranthetical Ponyo's friends made him a birthday present a bracket sequence! Ponyo was quite disappointed with his gift, because he dreamt of correct bracket sequences, yet his friends were uncultured in the art of correct bracket sequences. To make everything right, Ponyo is going to move at most one paranthesis from its original place in the sequence to any other position. Reversing the paranthesis (e.g. turning "(" into ")" or vice versa) isn't allowed. A bracket sequence, s, is called correct if: 1. s is empty. 2. s is equal to (t), where t is a correct bracket sequence. 3. s is equal to tita, where t, ta are correct bracket sequences. For example, " (00)", "O" are correct, while")" and "O)" are not. Help Ponyo fix his birthday present and understand whether he can move one paranthesis so that the sequence becomes correct. You are required to submit code for this question using the HackerRank website here