How we calculate the answer of following recurrence?

$$T(n)=4T\left(\frac{\sqrt{n}}{3}\right)+ \log^2n.$$

Any nice solution would be highly appreciated.

My solution is:

$n=3^m \to T(3^m)=4T(\frac{3^{m/2}}{3})+log^2 3^m = O(Log^2 n log n log n)$ 


Question: Making a C++ app scriptable
Answer: As Daniel said: 

Script languages like Lua and Python would be the most used script languages for binding together c++ libraries.

You will have to add a script interface to your c++ application. The buildup of this interface obviously depends on what script language you chose.