Can I get the solution in Python Beauty of a path is defined asthe number of most frequently occurring alphabet. Find the mostbeautiful path and return the maximum beauty value it has.

Given a directed graph with N nodes and M edges. Each node isassociated with lowercase english alphabet. CONSTRAINTS: 1 < N,M< 300000 **FUNCTION DESCRIPTION: ** Complete the function beautyin code. Function must Return an integer, the beauty of mostbeautiful path. If the value is very large return -1. Functionbeauty has the following parameter(s): n: integer, number of nodesm: integer, number of directed edges S: string of length n whereith alphabet denotes the alphabets associated with ith node X: listof length m Y: list of length m Input 1: n: 5 m: 4 s: abaca x: [ 1,1, 3, 4] y: [ 2, 3, 4, 5] Input 2: n: 6 m: 6 s: xzyabc x: [ 1, 3,2, 5, 4, 6 ] y: [ 2, 1, 3, 4, 3, 4]