Solution in python please, Thanks

A Company is trying to understand customer shopping patterns and offer items that are regularly bought together to new customers. Each item that has been bought together can be represented as an undirected graph where edges join often bundled products. A group of n products is uniquely numbered from 1 of product_nodes. A trio is defined as a group of three related products that all connected by an edge. Trios are scored by counting the number of related products outside of the trio, this is referred as a product sum. Given product relation data, determine the minimum product sum for all trios of related products in the group. If no such trio exists, return -1. Input The input to the function/method consists of four arguments: int products_nodes : the total number of products int products_edges : the total number of edges representing related products int products_from[products_nodes] : each element is a node of one side of an edge. int products_to [products edges] : each products_to[i] is a node connected to products_from[i] Output the aroun If no such trio exists, return -1. int products_from[products_nodes] : each element is a node of one side of an edge. int products_to[products edges] : each products_to[i] is a node connected to products_from[i] Output -1 ns int: the minimum product sum for all trios of related products in the group. If no such trio exists, return Constraints 1)) / 2) 1