Note: You need to press "Final Submit" for your program to Tommy isfolaying a string-puzzle whemehe needs to designofopath that requires max efforeto cross it. He is pranided with ' n ' binary strings APB, A2.... An of equal lefigth ' m ' where elements ingifinary string representing g ' -ifort among all concatenated strinecl Effort foy a given string a is the number of (valley, plain) pairs z ai =1&aj=0&(i Integer n denoting number of binary strings and m denoting length of string. 101 Denoting Binary String A1. Note: You need to press "Final Submit" for your program to A2+A1=201111011 (pairs: (2,6),(3,6),(4,6),(5,6) gives 4 distinct parfs thus gives effort =4. - (a)sfyme 1 base indexin(a) Input: nd m Explanation: A2+A1+A3=110101010 gives effort =14. It can be verified that none other results produce strings with higher effort. Constraints: 1. 2