<prompt> Andika suluhisho la tatizo lifuatalo katika javascript: Kutokana na mizizi ya mti wa utafutaji wa binary na integer k, kurudi kweli ikiwa kuna vipengele viwili katika BST hivyo kwamba jumla yao ni sawa na k, au uongo vinginevyo.  <response>: Heres one possible solution:function findTargetroot, k const set new Set; function traversenode if !node return false; empty node if set.hask - node.val return true; found a pair that adds up to k else set.addnode.val; add current node to set return traversenode.left traversenode.right; recursively traverse left and right child nodes return traverseroot; start traversing from the root nodeExplanation:We use a set to keep track of the values seen so far in the binary search tree as we traverse it recursively. For each node encountered, we check if its complement i.e., k - node.val is already in the set. If it is, we have found a pair that adds up to k and we return true. If not, we add the current nodes value to the set and continue traversal recursively on the left and right child nodes. If we exhaust all nodes and dont find a pair that adds up to k, we return false.Example usage:const root val: 5, left: val: 3, left: val: 2 , right: val: 4 , right: val: 6, right: val: 7 ;console.logfindTargetroot, 9; trueconsole.logfindTargetroot, 28; false 