Implement Improved MaxStackCalculator

[PhilippNaused]

I have refactored the MaxStackCalculator to be faster and not fail on obfuscated code.
The new implementation traverses the instructions the same way an IL interpreter would, using multiple recursion on branch instructions.
Here is the original: https://github.com/PhilippNaused/Vilens/blob/main/src%2FVilens%2FHelpers%2FStackHelper.cs

I tested this on multiple different libraries both before and after code obfuscation.
The old implementation would often fail on obfuscated code. This one doesn't.

The new version is also faster and uses less memory:

Method	Mean	Error	StdDev	Ratio	RatioSD	Gen0	Gen1	Allocated	Alloc Ratio
old	5.243 μs	0.1259 μs	0.1884 μs	1.00	0.05	1.2894	0.0687	21.79 KB	1.00
new	3.460 μs	0.0594 μs	0.0889 μs	0.66	0.03	0.0725	-	1.23 KB	0.06