Can someone send the solution

For the grammar Sa S a | aa construct LL parsing table and show how string “aaaaaa” is parsed in top down parser