$*$ no Chat gpt answers and wrong answers $*$ will report if copied from any source

Question $1$: Implement the Levenshtein distance algorithm to find the minimum number of edits required to convert one string into another.

Question $2$: Implement Dijkstra's algorithm using a Fibonacci heap data structure for efficient priority queue operations.