Hash Tables, Binary Search Trees, HeapsDevelop a system that processes and manages a stream of social media posts. Each post has a unique datetime value, the post, and the person who posted it.Requirements[1] If you need to find a post by its unique datetime value, what data structure would you use? Implement your solution.[2] If you need to find posts in a specific time range (e.g., start datetime, end datetime), what data structure would you use? Why? Implement your solution.[3] Imagine that we want to prioritize the social media posts by the number of views, and we want to be able to retrieve the post with the most views. What data structure would you use? Why? Implement your solution.[4] Provide complexity ( T(n) and O(n) ) analysis for the algorithms you developed. All done in a python # Generate the PDF reportgenerate_pdf_report()

Hash Tables, Binary Search Trees, HeapsDevelop a system that processes and manages a stream of social media posts. Each post has a unique datetime value, the post, and the person who posted it.Requirements[1] If you need to find a post by its unique datetime value, what data structure would you use? Implement your solution.[2] If you need to find posts in a specific time range (e.g., start datetime, end datetime), what data structure would you use? Why? Implement your solution.[3] Imagine that we want to prioritize the social media posts by the number of views, and we want to be able to retrieve the post with the most views. What data structure would you use? Why? Implement your solution.[4] Provide complexity ( T(n) and O(n) ) analysis for the algorithms you developed. All done in a python # Generate the PDF reportgenerate_pdf_report()