Please provide Python programs along with the screenshot of the program as well as output for the below programs 4. Inorder Traversal Given a binary tree root, return an inorder traversal of root as a list. 5. Count BST Nodes in a Range Given a binary search tree root, and integers lo and hi, return the count| of all nodes in root whose values are between, hi inclusive). 6. Palindrome Linked List Given a singly linked list node whose values are integers, determine whether the linked list forms a palindrome