Match Payment Transaction

Given a payment and its information, and an array containing other transaction information, the task is to match the payment to a transaction. The problem has three parts, each requiring a different method to match a transaction. There may be multiple transactions that match in each part, so choose the optimal matching approach and record the current best choice. Update the best choice during traversal if a better matching transaction is found. Implement the solution based on the given information. Example Input payment=...; transactions=[...]