There Are 3 Questions In 1.5 Hours.

1. Given A String Consist Only 2 char 'a' and 'b'. Your Have To Find Lexicographically Smaller Subsequence Of Length K with Minimum Of X Number Of 'b' char. Ex. s='abab' k=3 X=2 ans='abb'
2. Your Are Given To Int Arry A And B Of Length n. And For A[i] (0<i<n) You Can Take Any B[j] (0<j<n) And Take Opration Of A[i]= A[i]+B[j] or A[i]=A[i]*B[j].(Note: You Can Take Any Element Of B AtMost 1 Time). And Then Multiple All Element Of A With Module of 1000000007. Please Write Code If You Have Solution.
3. Variations Of Dijkstra.