please write code in python please

will upvote !

Write a function called problem 5(s1,s2) that can receive two strings. Develop a DP algorithm to determine if s1 is a subsequence of s2. Return True if yes, return False otherwise. A subsequence is defined as a string created from the original string by getting at least one character without changing their original relative positions. For example, "pah" is a subsequence of "peach" but "pha" is not. Test case: problem5("pah", "peach")