write an algorithm for priority queue? write a program to convert a3b3c2 to aaabbbcc? Given a function KNOWS(A,B), which returns 1 if A knows B (and not necessarily the other way around) and 0 if A does not know B. A Celebrity is one who does not know anyone, and one who is known by everybody. For a list of N people, find all celebrities in linear time. Given a source string and a destination string write a program to display sequence of strings to travel from source to destination. Rules for traversing: 1. You can only change one character at a time 2. Any resulting word has to be a valid word from dictionary Example: Given source word CAT and destination word DOG , one of the valid sequence would be CAT -> COT -> DOT -> DOG Another valid sequence can be CAT -> COT – > COG -> DOG One character can change at one time and every resulting word has be a valid word from dictionary