<prompt> Kutatua hii changamoto ya programu ya ushindani kwa kutumia C : Kutokana na mizizi ya mti binary, kurudi jumla ya majani yote kushoto. jani ni node bila watoto. jani kushoto ni jani ambayo ni mtoto kushoto wa node nyingine.  <response>: Heres a possible solution in C:class Solution public: int sumOfLeftLeavesTreeNode root if !root return 0; if root-left !root-left-left !root-left-right If the node has a left child which is a leaf, add its value to the sum return root-left-val sumOfLeftLeavesroot-right; Traverse the rest of the tree and check for left leaves return sumOfLeftLeavesroot-left sumOfLeftLeavesroot-right; ;This solution recursively traverses the tree and checks if each node has a left child which is a leaf. If so, it adds its value to the sum and continues to traverse the right subtree. Otherwise, it simply continues traversing both subtrees. The function returns the final sum computed this way. 