For this Question: Given a string. Find out the distinct alphabets and the number of times they occur.The input contains a single string S.

Constraints:-
1 <= |S| <= 100000

Note:- String will contain only lowercase characters and spaces.Print 26 space separated numbers that denote the number of occurrences of each character from 'a' to 'z'.Sample Input:-
newton school

Sample Output:-
0 0 1 0 1 0 0 1 0 0 0 1 0 2 3 0 0 0 1 1 0 0 1 0 0 0, I have written this Solution Code: from collections import defaultdict
st=input()
d=defaultdict(int)
for i in st:
  d[i]+=1
alpha="abcdefghijklmnopqrstuvwxyz"
for i in alpha:
  print(d[i],end=" ")
, In this Programming Language: Python, Now tell me if this Code is compilable or not?