Many people put bumper stickers on their cars. Bumper stickers can be funny and$/$or offensive $($to varying degrees$).$ Imagine that you have access to a variety of bumper stickers and want to find the minimum number of these stickers to have a certain total funniness and a certain total offensiveness. More formally:Input: Stickers $=1($fi$,$ oi$)\}$:$=1,$ FunnyGoal, OffenseGoalOutput: The size of the smallest subset S of stickers such that Liesfi FunnyGoal and Lieso, OffenseGoal.Design a dynamic programming algorithm to solve this problem and use your algorithm to solve the following instance.Stickers $=1(1,7),(6,2),(5,4),(3,6),(10,2),(1,6),(8,2),(7,3),(10,1),(7,8),(10,10),(7,2),(6,4),(3,4),(2,5),(5,2),(8,6),(4,7),(6,4),(6,3)\},$ FunnyGoal $=55,$ OffenseGoal $=48.$