Subset Sum

My project is to develop a Subset Sum algorithm using a dynamic programming approach. The goal of the algorithm is to find a subset from a given set of numbers which can be summed up to exactly a given target number. Additionally, I need the algorithm to be able to handle approximate solutions. For example, if the perfect solution is not found, it should return the set that has the minimum absolute difference to the target number. Finally, I require the output of the algorithm to be presented in a certain form. After running the algorithm, I should be able to clearly identify whether a perfect or approximate solution was obtained, and the code should have the ability to generate a visualization to present the obtained results.