function [solvable, solution] = M12_solve(BST, input)

if input == [1 2 3 4 5 6 7 8 9 10 11 12]
    solvable = 1;
    solution = 'Already sorted';
    return
end

[solvable,~,solution]=BST_search_func(BST,input); % NOTE< change BST_func to a specific search function, 
% otherwise you will put bad entries into the search tree
if solvable == 1
    solvable = 'This permutation can be solved';
else
    solvable = 'This permutation cannot be solved';
end

end