3. Implement a Splay Tree based off of the design in question (a) Using the command-line, your program should be called as java SplayTree step-to-traverse (b) will be the name of the local file to be loaded that contains operations (c) [step-to-traverse wil be an optional number, and after that many operations you will output a post-order traversal of your tree. eg. 1 would mean showing the traversal after a single operation. (d) Your program should output the following statisties after all operations are processed: The total number of comparisons between nodes (not checks for nul. The total number of Zig-Zig operation:s The total number of Zig-Zag operations (e) The operations in the source file will be one-per-line and will consist of the letters ar or f, representing add, remove or find respectively, followed by digits, the value for the node. Digits ([) The sample source file that your should run your code against is (g) note: The tree starts out empty and is filled by the operations.txt (or similar file). Your program (h) a traditional Splay tree splays nodes all the way back to the root, using a 'zig' operation whern may or may not be 0-padded, just assume after the letter it's all the digits till the next linebreak https://users.encs.concordia.ca/-sthiel/comp352/0perations.txt should deal properly with trying to find or delete nods that aren't in the tree. at the node just before the root, but in this implementation you should skip the zig' operation allowing the node to stay as a child of root if that's where it ends up. 3. Implement a Splay Tree based off of the design in question (a) Using the command-line, your program should be called as java SplayTree step-to-traverse (b) will be the name of the local file to be loaded that contains operations (c) [step-to-traverse wil be an optional number, and after that many operations you will output a post-order traversal of your tree. eg. 1 would mean showing the traversal after a single operation. (d) Your program should output the following statisties after all operations are processed: The total number of comparisons between nodes (not checks for nul. The total number of Zig-Zig operation:s The total number of Zig-Zag operations (e) The operations in the source file will be one-per-line and will consist of the letters ar or f, representing add, remove or find respectively, followed by digits, the value for the node. Digits ([) The sample source file that your should run your code against is (g) note: The tree starts out empty and is filled by the operations.txt (or similar file). Your program (h) a traditional Splay tree splays nodes all the way back to the root, using a 'zig' operation whern may or may not be 0-padded, just assume after the letter it's all the digits till the next linebreak https://users.encs.concordia.ca/-sthiel/comp352/0perations.txt should deal properly with trying to find or delete nods that aren't in the tree. at the node just before the root, but in this implementation you should skip the zig' operation allowing the node to stay as a child of root if that's where it ends up