Dynamic programming and divide and conquer to make algorithms and analyze them. Python or Java

Dynamic programming and divide and conquer to make algorithms and analyze them. Python or Java. Hello, I have homework on dynamic programming and divide and conquer.
I want you to write an algorithm then analyze that algorithm using both techniques.
Don’t take my question if you don’t know how to code those techniques!!!
I HAVE ANOTHER PROJECT IN 2 WEEKS THE BID WILL BE 40\$ IF YOU DO GOOD IN THIS ONE I’LL BE WORKING WITH YOU ON MY FUTURE PROJECTS.
—————————————————————————————————————————————–
Consider the function intHowManyWays(int n) where n is the number of matrices to be multiplied and returns the number of ways to fully parenthesize them (the number of different ways to multiply the n matrices).
1. Write an algorithm using the divide and conquer technique.
2. Analyze your algorithm from part 1. What is the time complexity?
3. Write an algorithm using the dynamic programming technique.
4. Analyze your algorithm from part 3
5. What is the time complexity?

Dynamic programming and divide and conquer to make algorithms and analyze them. Python or Java 