Safe Bracket Corridor

A robot crosses a grid from the top-left cell to the bottom-right cell. It may only move one cell down or one cell right. Each visited cell writes one bracket character, either ( or ), onto the robot's audit tape. A route is accepted only if the full tape is a valid bracket sequence. That means every prefix of the tape must have at least as many opening brackets as closing brackets, and the complete tape must end with equal counts of opening and closing brackets. Input Format: You are given an array grid of strings, where each character is either ( or ). Output Format: Return true if at least one accepted route exists, otherwise return false.