Write a function called get_layers_dict(root) that takes the root of a binary tree as a parameter. The function should return a dictionary where eachkeyis an integer representing a level of the tree, and eachvalueis a list containing the data from the nodes at that level in left to right order. The root of the tree is at level 0. Note:An implementation of the BinaryTree class is provided. You do not need to provide your own. You will have the following BinaryTree methods available: BinaryTree, get_data, set_data, get_left, set_left, get_right, set_right, and str.You can download a copy of the BinaryTree class here.

For example:

Test	Result
root = BinaryTree('A', BinaryTree('B'), BinaryTree('C')) print(get_layers_dict(root))	{0: ['A'], 1: ['B', 'C']}
root = BinaryTree('A', right=BinaryTree('C')) print(get_layers_dict(root))	{0: ['A'], 1: ['C']}