can you help with a programming assignment?

Pro em3 Given the root of a binary search tree (BST), convert it to a greater sum tree (GST) such that for each node in the BST, its value MI is updated to the sum of all values greater than or equal to WI. Note: 0 Assume the values of all nodes are distinct. 0 You may change the values of the input EST directly or may create a new tree as the output. Either way, you need to return the root of the GST. Example: Given the mat of the following BST: Account 3. Convert Binary Search Tree def convertBSTtoGST (root ) : Dashboard return Courses Groups V Inbox UCD Librar O History Help