Encode itYou are given an integer N$.$ You need to use Base$-62$ encoding and return the resulting string.Note In Base$-62$ encoding, we use: $0-9->0-910-35->$ A$-$Z $36-61->$ a$-$zTaskFor each given integer, print the Base$-62$ encoded string.ExampleAssumption N: $1212$Approach We get the encoded string as JY$.$ It can be verified as: $62*19+34=1212$Function descriptionComplete the function solve$().$ This function takes the following parameters and returns the required string: N: Represents the integer to be encoded.Input formatNote: This is the input format that you must use to provide custom input $($available above the Compile and Test button$).$ The first line contains a single integer T that denotes the number of test cases. T also denotes the number of times you have to run the solve$()$ function on a different set of inputs. For each test case: The single line contains a positive integer N$.$Output FormatFor each test case print the encoded string on a new line.Constraints$1$T$1050$N$1018$Code snippets $($also called starter code$/$boilerplate code$)$This question has code snippets for C$,$ CPP$,$ Java, and Python.Sample input$124523$Sample output$6$NXExplanationGiven T: $1($number of test cases$)$ For the first test case we have: N: $24523$Approach We get the encoded string as $6$NX$.$ It can be verified as: $62*62*6+62*23+33=24523$The following test cases are the actual test cases of this question that may be used to evaluate your submission.Sample input $12004923381003922735959763287078328792878102443278908450713194810529340463223815629288708698843194178672395524932924073794623045831578981438692767$Sample output $10$aMueLnvYR$11$A$7$awPLeguFxqvVlISYl$52$MK$0$JC$8$aD$2$Hal$15$a$0$sou$3$BpRjl$1$nRk$16$unjU$8$VF$6$DzQdiIlRMj$9$FSBmfYWXePView moreSample input $25084375455369277052123772444125179137754446487156255038016070061723258101842615006579452210914930532661911977746294274348874855896933718308800117608504772433562077$Sample output $210$KP$64$xfEqXHYmO$6$BdAg$5$eDebOAmCei$1$BbGRnnEjl$10$FBViGsyDC$15$aOH$6$Rjfsft$82$DCuQfcV$14$Fxt$5$tEsWziwxPkwUPaHYlyvKFKMFAView moreNote:Your code must be able to print the sample output from the provided sample input. However, your code is run against multiple hidden test cases. Therefore, your code must pass these hidden test cases to solve the problem statement.LimitsTime Limit: $1\mathrm{.}0$ sec$($s$)$ for each input fileMemory Limit: $256$ MBSource Limit: $1024$ KBScoringScore is assigned if any testcase passesAllowed LanguagesBash, C$,$ C$++14,$ C$++17,$ Clojure, C#$,$ D$,$ Erlang, F#$,$ Go$,$ Groovy, Haskell, Java $8,$ Java $14,$ JavaScript$($Node$.$js$),$ Julia, Kotlin, Lisp $($SBCL$),$ Lua, Objective$-$C$,$ OCaml, Octave, Pascal, Perl, PHP$,$ Python, Python $3,$ Python $3\mathrm{.}8,$ Racket, Ruby, Rust, Scala, Swift, TypeScript, Visual Basic